GATE | GATE-CS-2006 | Question 10

In a binary max heap containing n numbers, the smallest element can be found in time
(A) O(n)
(B) O(Logn)
(C) O(LogLogn)
(D) O(1)

Answer: (A)
Explanation: See Question 1 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-7/amp/
Quiz of this Question