You are on page 1of 33

Let H be a binary 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?
(A) Θ(1)
(B) Θ(log n)
(C) Θ(n)
(D) Θ(n*log n)

You might also like