Question: 1. In an array-based heap, assuming heap entries start at index I, the right child of node 'n' is at index a. 2n b. 2n+1
1. In an array-based heap, assuming heap entries start at index I, the right child of node 'n' is at index a. 2n b. 2n+1 c. n d. n/2 2. A map can have mapping a. Many to one b. One to one c. Many to many d. both a &b 3. Primary Clustering can increase the complexity of Hashing up a. O(nlogn) b. O(n) c. On) d. O(1) to 4. For an AVL tree, the balances of the nodes are always a. -1, 1, -2 b. -1,2,1 C. -1, 0,1 d. -2,0,-2 5. In a Red Black tree, the color of root node is and the color of leaf node is a, red, red b. red, black c. black, red d. black, black 6. If height of the 2-3 tree is 3, then the possible total number of nodes lies between a. b. c. d. 7. A vertex with degree zero is called a. Pendant vertex b. End vertex c. Isolated vertex d. Adjacent vertex
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
