2. What would the above 2-3 look like if we insert 25?

3. Draw the 2-3 tree resulting from inserting keys 1 to 10 in order.

4. What is the maximum height of a 2-3 tree with n nodes?

5. For the above heap, the array indexes are indicated in [ ]'s. For a node at index i, what is the index of:

a) its left child if it exists:

b) its right child if it exists:

c) its parent if it exists:

6. Why aren't arrays used to store general BST's?

7. What would the heap look like after inserting 80?

8. What would be the height of a heap containing n nodes?