Heaps - Study Mode
[#96] Which one of the following array elements represents a binary min heap?
Correct Answer
(B) 8 10 12 25 14 17
[#97] Min heap can be used to implement selection sort.
Correct Answer
(A) True
[#98] What would be the result if the left subtree of the root has a null path length of 1 and the right subtree has a null path length of 2?
Correct Answer
(D) violation at the root
[#99] What will be the order of new heap created after union of heap H1 and H2 when created by the following code.Initially both are of the order n. FIB_UNION(H1,H2)
{
H =MAKE_HEAP()
min[H]= min[H1]
concatenate the root list of H2 with the root list of H
if (min[H1] = NIL) or (min[H2]!= NIL and min[H2] < min[H1])
then min[H] = min[H2]
n[H]= n[H1] + n[H2]
free the objects H1 and H2
return H
}
Correct Answer
(A) n+1
[#100] What is the complexity of adding an element to the heap.
Correct Answer
(C) O(log n) & O(h)