In which order do you have to insert the values [54, 51, 24, 37, 13, 99, 49] into an initially empty binary search tree in order to get a full binary search tree? A "full binary tree" is a tree in which every node other than the leaves has two children. Draw the resulting tree Consider the following Python list: [80, 23, 27, 31, 25, 35, 37] Suppose the elements in the above list are inserted into an initially empty binary search tree in that order. What does the Binary Search Tree look like? Draw the resulting tree