In a heap with n elements with the smallest element at the root, the 7th…

PYQ GATE 2003

In a heap with n elements with the smallest element at the root, the 7th smallest element can be found in time

  1. A.

    Θ(n log n)

  2. B.

    Θ(n)

  3. C.

    Θ(log n)

  4. D.

    Θ(1)

Attempted by 935 students.

Sign up free to check your answer

Sign up free

Explore the full course: Data Structures

Loading lesson…