A binary min heap consisting of integers is implemented using array A[l ....n] in which root node is stored at A[1] and locations A[l] 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

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

Open in App

Solution

The correct option is C 49
option (b)

It requires $[\frac{n}{2}] - 1$ comparisons to find maximum element of 'n ' 9 elements in binary heap.
So, it will take $[\frac{99}{2}] - 1$
= 49 comparisons.

Suggest Corrections

Similar questions

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 ?

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

T h e t i m e c o m p l e x i t y t o d e l e t e a n e l e m e n t a t

i n d e x^{'} K^{'} (K \leq n) i n a m i n - h e a p o f s i z e n i s

Join BYJU'S Learning Program