A binary min heap consisting of integers is implemented using array A[1 ....n] in which root node is stored at A[1] and locations A[1] through A[n] store the 'n' integer values in the heap. The minimum number of comparisons required to find maximum element in a min heap of 99 elements is

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

Open in App

Solution

The correct option is D 49
$O p t i o n (b)$

$I t r e q u i r e s [\frac{n}{2}] - 1 c o m p a r i s o n s t o f i n d$
$m a x i m u m e l e m e n t o f^{'} n^{'} 9 e l e m e n t s i n$
$b i n a r y h e a p .$

$S o, i t w i l l t a k e [\frac{99}{2}] - 1$

$= 49 c o m p a r i s o n s$

Suggest Corrections

Similar questions

T h e n u m b e r o f e l e m e n t s t h a t c a n b e s t o r e d

i n Θ (l o g n) t i m e u s i n g h e a p s o r t i s

Consider the binary min heap given below : (min heap is a binary tree where each node in a tree has a key which is less than or equal to the key of its children) Insert the key 1 in above min heap which of the following is the resulant min heap after two delete operations ?

Join BYJU'S Learning Program