Gate CS-2015-2 Question Paper With Solutions

Q. 19 Consider a complete binary tree where the left and the right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is

(A) Ω(logn)

(B) Ω(n)

(C) Ω(nlogn)

(D) Ω(n²)

Answer: (A)

Explanation: