1. Below are two different permutations of the numbers 1 through 7.  Draw the resulting binary tree if these numbers were inserted into a binary search tree in the order they are shown.

a. 4, 5, 3, 2, 7, 6, 1
b. 3, 5, 4, 1, 7, 2, 6

2. Given the tree below, show what the resulting trees would be after deleting the specific nodes.
       4
     /   \
    3     6
   /     / \
  1     5   7
   \
    2

a. delete 5
b. then, delete 1
c. then, delete 4

Remember, there are three cases for delete:
- If the node is a leaf: just delete it
- If the node has a single child: splice it out by setting that child to be the child of the node's parent
- If the node has two children: replace it with the "successor"
-- if the successor is a leaf, just remove the successor and place where the delete node was
-- if the successor is not a leaf, splice it out (the successor will NEVER have two children)