1. Draw the heap generated by adding the following numbers in the following
   order:

  2 19 7 10 8 6 13 15 11 9 30

2. Draw the binary search tree generated by adding those same numbers in
   the same order.


3. Now, remove the following nodes in the following order, and show how it
   changes the BST and the heap:

  6 13 9 2;