This week's lab assignment may be completed on paper. Once you have finished, you may scan your work to submit it$,$ or take a picture with your phone.

Suppose we want to add the following values to a binary search tree: $10,5,6,13,15,8,14,7,12,4$

Draw the results of adding the above values to an initially empty binary search tree in the order they are shown.

What ordering of the above values would result in the most balanced tree when added to an initially empty binary search tree?

Give four different orderings of the same values that would result in the least balanced tree when added to an initially empty binary search tree.