s. Problem: We want to insert the numbers in the set (1,2,3.15) into an initially empty binary search tree. Give an ordering of the insertions of these elements into the search tree so that the height of the resulting search tree is minimum. For example, the ordering (1,2,3..15) would give us a search tree of height 14