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/

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.