To represent a heap in an array, place the result of a(n) locations beginning at index 1. 1. traversal into consecutive array a. inorder b. preorder c. level order d. postorder 2. In an array-based heap, assuming heap entries start at index 1, the right child of node n is at index a. 2n b. n c. n/2 d. 2n+1 3. In the array-based heap implementation, the method add has efficiency a. O(log n) b. O(n) d. O(n2 If the numbers 5, 13, and 23 are added to an empty binary search tree in that order, in order to rebalance it, you need a(n) 4 a. left right rotation b. right rotation c. no rotation d. left rotation e. right left rotation s. The most programming intensive part of merge sort is a. the division step b. the comparison of items c. the merge step d. the mergesort step 6. After merging two arrays is complete, you need to a. copy the original array to the temporary array b. copy the merged array back to the original array c. copy the rest of the first array elements to the temporary array