Let \(H\) be a binary min-heap consisting of \(n\) elements implemented…
PYQ GATE 2021
Let be a binary min-heap consisting of elements implemented as an array. What is the worst case time complexity of an optimal algorithm to find the maximum element in ?
- A.
- B.
- C.
- D.
Attempted by 1095 students.
Sign up free to check your answer
Sign up freeLoading lesson…

