In a binary search tree, which element does not have a A. any one of the leaves B. the maximum C. the minimum D. the root Suppose the tree below is a binary search tree whose keys are not shown. Which node will contain the key that is the predecessor of the key stored at H? 1. 2. A. A B. B C. C D. G . Which of the following will not be true regarding the decision tree for MERGESORT for sorting n input values? A B. C. D. There will be a path from the root to a leaf with 1-1 decisions There will be n! leaves Every path from the root to a leaf will have n-1 decisions The height of the tree is (n log n A. (1) 4. What is the worst-case time to perform MAXIMUM(L) for an unordered, doubly-linked list with nodes? B. (log n) (n) D. (nlogn) C. 5. Given a pointer to a node, the worst-case time to delete the node from a doubly-linked list with n nodes in ascending order C. (n log n) D. (n) A. (1) B. (log n) What is the worst-case time to find the predecessor of a key in an unbalanced binary search tree storing n keys? Assume that parent pointers are available 6. (1) B. (log n) C. (n) D. (n log n) A. An array with 150 unique elements is subscripted starting with 0. You would like to iteratively use PARTITION to find the thirty largest values, but there is no requirement that the thirty largest values be ordered. Which of the following is not correct? A. If 119 is returned from PARTITION, we must continue B. If 118 is returned from PARTITION, we must continue C. If 131 is returned from PARTITION, we must continue D. If 120 is returned from PARTITION, we are done 7