1. Explain the differences between our specifications of the Sorted List ADT and the Binary Search Tree ADT.
2. Define a client method that returns a count of the number of nodes in a binary search tree that contain a value less than or equal to the argument value. The signature of the method is: intcountLess(BinarySearchTree tree, Golfer maxValue)
3. Show the binary search tree whose elements are inserted in the subsequent order: 50, 72, 96, 94, 107, 26, 12, 11, 9, 2, 10, 25, 51, 16, 17, 95
4. Consider 100 integer elements are chosen at random and are inserted into a sorted link list and a binary search tree. Describe the efficiency of searching for an element in each structure, in terms of Big-O notation.
5. Show the tree that would result from storing the nodes of the tree in Figure (a) (in your textbook) in postorder order into an array, and then traversing the array in index order while inserting the nodes into a new tree.
