Draw a tree that would be constructed by the program tree_sort given a list with the same numbers as above, but in the order 113, 264, 265, 265, 467, 907. What happens to the efficiency of inserting...

Draw a tree that would be constructed by the program tree_sort given a list with

the same numbers as above, but in the order 113, 264, 265, 265, 467, 907. What happens to the efficiency of inserting new nodes into this tree compared with the tree

given in Figure 10-13?