GATE | CS | 2020 | Data Structures | Binary Heaps | Question 57

Last Updated :
Discuss
Comments

Consider the array representation of a binary min-heap containing 1023 elements. The minimum number of comparisons required to find the maximum in the heap is _________ . 

510

511

512

255

This question is part of this quiz :

Top MCQs on Heap Data Strcuture with Answers,GATE CS 2020,Data Structures GATE CS PYQ QUIZ,Binary Heaps GATE CS PYQ Quiz
Tags:
DSA Quiz
GATE
Data Structures
GATE CS
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy