Answer to Question #204537 in Python for laurevil

Question

Hola! Help me with this thank you! Please do a code without using 'def' thank you.

Python - Tree Operation:

Given the following values: 30,23,16,28,28,90,78,7,15 and 46

- Insert all data into a binary tree in order from 30 to 46. The root is 30. (Draw the Tree) .

- Delete node that consists of 90 (Draw the Tree after deletion)

- Arrange updated data (after deleting 90) In order, Preorder and Post order

Answer 1

Dear laurevil, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order