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

PYQ GATE 2015

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

  1. A.

    Ω(log 𝑛)Ω(log \ 𝑛)

  2. B.

    Ω(𝑛) Ω(𝑛)

  3. C.

    Ω(𝑛 log 𝑛)Ω(𝑛 \ log \ 𝑛)

  4. D.

    Ω(𝑛2)Ω(𝑛^2)

Attempted by 805 students.

Sign up free to check your answer

Sign up free

Explore the full course: Data Structures

Loading lesson…