1. Give an insertion order of the elements below that would result in the most balanced binary search tree.

Submit the ordering and a drawing of the tree.

3, 6, 9, 10, 12, 14, 16, 19, 24, 27

Is the tree you drew above unique?

In other words, is this the only possible more balanced binary search trees for these numbers?

2. Draw the binary search tree that results from adding the following numbers in this order.

13, 9, 10, 15, 21, 14, 19, 12, 11, 4

Is the binary search tree you drew above unique?

In other words, is this the only possible binary search tree for the numbers inserted in this order?