← GATE CSE 2006

Q10

MCQ1 mark, −0.25

In a binary max heap containing $n$ numbers, the smallest element can be found in time

(A)

$O(n)$

(B)

$O(\log n)$

(C)

$O(\log \log n)$

(D)

$O(1)$

Sign in to save attempts.

Loading…