Question: 3. (Basic) Consider the following binary search tree where nodes are labeled by alphab Here the keys are not shown in the picture; a, b,

3. (Basic) Consider the following binary search tree where nodes are labeled by alphab Here the keys are not shown in the picture; a, b, c, ..- are node labels, not keys. Assu that all keys have distinct values (a) What is the node with the min key value? (b) What is the node with the max key value? (c) What is the node with the upper median key value? (d) What is the node with the lower median key value? (e) What is e's successor? (f) What is i's successor? (g) What is g's successor? (h) What is j's predecessor? 4. (Basic) Consider the BST in the above problenm (a) Delete node b and show the resulting BST. (b) Continue to delete another node c and show the resulting BST. (c) Continue to delete another node h and show the resulting BST
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
