FOR PMY 1733 ONLY

1. [3] Remove 5 from the following AVL tree; draw the results:

2. [3] Insert the value "8" into the following AVL tree; draw the result:

3. Given the following AVL tree:

A. [3] Add 45 to the tree.

B. [3] Ignoring all previous tasks, add values 9 and 8 to the tree.

C. [3] Ignoring all previous tasks, remove values 10 and 30 from the tree.

D. [3] Ignoring all previous tasks, remove 80 and 100 from the tree.

4. Binary Heaps (i.e. Priority Queues) Starting with an empty binary min heap, show the following. Be sure to clearly label each diagram.

A. [3] The final state of the heap, in tree form, after adding in the values: 5, 4, 3, 6, 7, 8, 10, 2, 9, 1

B. [3] The state of the heap, in tree form, after two Dequeue() operations

C. [2] The final, array-based version of the heap