Heaps - Study Mode

[#136] What is the height of a given minimum ternary heap?
Correct Answer

(A) 1

[#137] In a leftist heap, the null path length of a null node is defined as?
Correct Answer

(D) -1

[#138] The roots of the elements of the subtrees are smaller than the root of the heap.
Correct Answer

(B) False

[#139] In a binomial heap the root value is greater than left child and less than right child.
Correct Answer

(B) False

[#140] The worst case complexity of deleting any arbitrary node value element from heap is . . . . . . . .
Correct Answer

(A) O(logn)