7) An array of n numbers is given, where n is an even number. The maximum as well as the minimum of these n numbers needs to be determined. Which of the following is TRUE about the number of comparisons needed?

8) The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is

9) The average search time of hashing, with linear probing will be less if the load factor

10) Heap allocation is required for languages

11) A list integers is read in, one at a time, and a binary search tree is constructed. Next the tree is traversed would result in a printout which duplicates the original order of the list of integers