Last Updated : 26 Dec, 2018

Match the List-1: Operation in Heap Tree and there List-II: Time complexity in min Heap tree .

List-I List-II
(a) FindMin (i) O(log N)
(b) DeleteMin and Insert (ii) O(N)
(c) BuildHeap from N inputs (iii) O(N log N)
(d) FindMax (iv) O(1)

(A) (a) – (iv), (b) – (i), (c) – (ii), (d) – (iii)
(B) (a) – (ii), (b) – (iii), (c) – (i), (d) – (iv)
(C) (a) – (iii), (b) – (i), (c) – (ii), (d) – (iv)
(D) (a) – (iv), (b) – (i), (c) – (ii), (d) – (ii)


Answer: (D)

Explanation: Correct matching is (a) – (iv), (b) – (i), (c) – (ii), (d) – (ii).

Option (D) is correct.


Quiz of this Question


Share your thoughts in the comments