GATE | GATE-CS-2006 | Question 10
In a binary max heap containing n numbers, the smallest element can be found in time
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.