Heaps - Study Mode
[#106] Given a heap of n nodes.The maximum number of tree for building the heap is.
Correct Answer
(A) n
[#107] How many types of the merge are available in skew heaps?
Correct Answer
(B) 2
[#108] The ascending heap property is . . . . . . . .
Correct Answer
(B) A[Parent(i)] <= A[i]
[#109] The procedure FindMin() to find the minimum element and the procedure DeleteMin() to delete the minimum element in min heap take . . . . . . . .
Correct Answer
(D) constant and logarithmic time respectively
[#110] What is the amortized efficiency of skew merge?
Correct Answer
(B) O( log N)