​​​​​Let \(H\) be a binary min-heap consisting of \(n\) elements implemented…

PYQ GATE 2021

​​​​​Let HH  be a binary min-heap consisting of nn elements implemented as an array. What is the worst case time complexity of an optimal algorithm to find the maximum element in HH ?

  1. A.

    θ(1)\theta (1)

  2. B.

    θ(log n)\theta (log \ n)

  3. C.

    θ(n)\theta (n)

  4. D.

    θ(n log n)\theta (n \ log \ n)

Attempted by 1095 students.

Sign up free to check your answer

Sign up free

Explore the full course: Data Structures

Loading lesson…