NAME CSC 236 Trees Part 1 1. Consider the following binary search tree. Insert the keys 12 and 20 into the tree. Draw the final tree and all intermediate trees that you need. You must use the algorithms described in class for inserting data into a binary search tree. 15 2. Consider the following binary search tree. Remove the key 15 from the tree and draw the resulting tree. Then remove the key 35 from this new tree and show the final tree (so, in the final tree both keys, 15 and 35, have been removed). 10 30 3. Draw the binary search tree that results from adding the following integers (34 45 3 87 65 32 1 12 17). Assume our simple implementation. 4. Starting with the result from the above in #3, draw the tree that results from removing (45 12 1 34), again using our simple implementation. Show all 4 steps. In the last step, indicate the 2 possible resulting trees.