I don't need the code, just the output.

 50 20 60 10 40 70 30 

Use enough space to distinguish left children from right children. Another way to represent the tree in text form (that distinguishes left children from right children) is

50 20 10 40 30 xx 60 xx 70 

After inserting the nodes mentioned in part a, what would be printed out by in-order, pre-order, and post-order traversals of the tree (assume your traversal function prints out the number at each node as it is visited)?

After inserting the nodes mentioned in part a, what is the resulting BST after you delete the node 30, then the node 20? (Again, just use a simple deletion algorithm with no balancing. If you have an option of making a choice, any correct choice is acceptable.)