Use the steps of Algorithm 10.5.1 to build binary search trees. Use numerical order. The elements in the lists are the same, but the trees are different because the lists are ordered differently. (Enter NONE in any unused answer blanks.) (a) 11, 24, 22, 4, 15, 6,5 (b) 11, 5, 4, 22, 15, 24, 6



Answer :