Test Index

GATE Computer Science (CS) 2021 Shift 2 Solved Paper

© examsnet.com

Question : 12

Total: 65

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?

θ(log n)
θ(n)
θ(1)
θ(n log n)

Go to Question:

Prev Question

Next Question