In a binary max heap containing n numbers, the smallest element can be found…

PYQ GATE 2006

In a binary max heap containing n numbers, the smallest element can be found in time

  1. A.

    O(n)

  2. B.

    O(Logn)

  3. C.

    O(LogLogn)

  4. D.

    O(1)

Attempted by 1762 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…