We have a binary heap on n elements and wish to insert n more elements (not…

PYQ GATE 2008

We have a binary heap on n elements and wish to insert n more elements (not necessarily one after another) into this heap. The total time required for this is

  1. A.

    θ(logn)

  2. B.

    θ(n)

  3. C.

    θ(nlogn)

  4. D.

    θ(n2)

Attempted by 1027 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…