Skip to content
Related Articles

Related Articles

Save Article
Improve Article
Save Article
Like Article

GATE | GATE-CS-2006 | Question 10

  • Last Updated : 28 Jun, 2021

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

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

My Personal Notes arrow_drop_up
Recommended Articles
Page :