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

Submit the ordering and a drawing of the tree.

4, 5, 6, 8, 10, 12, 14, 15, 16, 17

Is the tree you drew above unique?

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

2. Draw the binary tree that represents the general tree below.

49 23 16 38 82 ) 53) ( 41 ) ( 82) ( 62 74