Heaps - Study Mode
[#86] d-heap is shallower than a binary heap.
Correct Answer
(A) true
[#87] The relationship of skew heaps to leftist heaps is analogous to that of?
Correct Answer
(A) Splay tree and AVL tree
[#88] 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)
Correct Answer
(A) True
[#89] What is the run time efficiency of an insertion algorithm?
Correct Answer
(A) O(N)
[#90] In a leftist heap, all the operations should be performed on?
Correct Answer
(C) right path