Consider a complete binary tree where the left and the right subtrees of the…

GATE · 2015 · CS · Set 2 · Computer Science & IT

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.
\(Ω(log \ 𝑛)\)
B.
\( Ω(𝑛)\)
C.
\(Ω(𝑛 \ log \ 𝑛)\)
D.
\(Ω(𝑛^2)\)

Attempted by 567 students.

Show answer

Correct answer: A

The worked solution is available to enrolled students.

Video solution available to enrolled students.

Explore the full course: Iocl Engineers Officers Grade A Paper 2