Give an order for inserting the numbers 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 such that the resulting tree is a complete binary search tree.

Question 2 The trouble with binary search trees is that they can become unbalanced depending on the order that you insert values. Give an order for inserting the numbers 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 such that the resulting tree is a complete binary search tree. This problem does not require you to fill in a tree, just write down the order in which you would insert the values. (Hint: it might be helpful to first draw the full/ complete tree to figure out how the values must be arranged, then you can determine the order to add them!)