(a) If the value 7 is inserted into this tree, which node becomes its parent?

(b) If the value 46 is inserted into this tree, which node becomes its parent?

(c) If the value 33 is inserted into this tree, which node becomes its parent?

(d) If the value 99 is inserted into this tree, which node becomes its parent?

(e) If the value 56 is inserted into this tree, which node becomes its parent?

(f) If the value 70 is inserted into this tree, which node becomes its parent?

(g) Write the PRE-ORDER traversal of the resulting tree from Question 1 (a-f).

(h) Write the POST-ORDER traversal of the resulting tree from Question 1 (a-f).

(i) Based on question 1(a-f), if we delete node 10, which node should be its replacement node?

(j) Based on question 1(i), If we delete node 46, which node should be its replacement node?

(k) Based on question 1(j), If we delete the root node 25, which node should be selected as its replacement node so that the fewest number of changes are made to the tree?

QUESTION 1. Consider the following binary search tree. Use the ORIGINAL BST below when answering each subpart (a) through (k). Assume node 25 is the root of BST 25 10 16 2 5 Your