GATE Computer Science (CS) 2021 Shift 2 Solved Paper

Question : 12 of 65

Marks: +1, -0

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