1.Draw the BST with level order C, A, D, B. Beneath the tree, list the 3 different insertion sequences that could have generated the tree.

2. Consider the bottom most BST drawn on page 401 of the text. Draw what the resulting tree looks like if G is inserted into this tree.

3. Consider the bottom most BST drawn on page 401 of the text. Draw what the resulting tree looks like if H is deleted from this tree.

4. Consider the bottom most BST drawn on page 401 of the text. Draw what the resulting tree looks like if E is deleted from this tree.

5. Page 424 of the text has a 2-3 tree. Draw what the tree looks like if the key D is inserted into this tree.

6. Page 424 of the text has a 2-3 tree. Draw what the tree looks like if the key T is inserted into this tree.

7. Do Exercise 3.3.3 on page 449 8. Do Exercise 3.3.7 on page 449, but only for the bottom 2 examples on page 428 (both examples labelled right).