P R I N C E T O G S
2. How many compares are used during the process depicted in question 1?
3. Draw a perfectly-balanced binary search tree with the keys A B C D E F G, such that D is the root, then draw the sequence of BSTs that result when you delete the minimum key, one by one (using the deleteMin() algorithm described on pages 242-243).