81. The relationship of skew heaps to leftist heaps is analogous to that of?
82. Given the pseudo code, state whether the function for merging of two heap is correct or not?
mergeTree(p,q)
if p.root.value <= q.root.value
return p.addTree(q)
else
return q.addTree(p)
mergeTree(p,q)
if p.root.value <= q.root.value
return p.addTree(q)
else
return q.addTree(p)83. What is the run time efficiency of an insertion algorithm?
84. In a leftist heap, all the operations should be performed on?
85. Given the code, choose the correct option that is consistent with the code. (Here A is the heap)
build(A,i)
left-> 2*i
right->2*i +1
temp- > i
if(left<= heap_length[A] ans A[left] >A[temp])
temp -> left
if (right = heap_length[A] and A[right] > A[temp])
temp->right
if temp!= i
swap(A[i],A[temp])
build(A,temp)
build(A,i)
left-> 2*i
right->2*i +1
temp- > i
if(left<= heap_length[A] ans A[left] >A[temp])
temp -> left
if (right = heap_length[A] and A[right] > A[temp])
temp->right
if temp!= i
swap(A[i],A[temp])
build(A,temp)86. Should leaves in ternary heap be distributed from left to right.
87. If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
88. Heap exhibits the property of a binary tree?
89. Pointer manipulation is generally more time-consuming than multiplication and division.
90. Which one of the following array elements represents a binary min heap?
Read More Section(Heaps)
Each Section contains maximum 100 MCQs question on Heaps. To get more questions visit other sections.