1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

# 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

A
98
No worries! Weâ€˜ve got your back. Try BYJUâ€˜S free classes today!
B
48
No worries! Weâ€˜ve got your back. Try BYJUâ€˜S free classes today!
C
49
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
D
99
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 [n2]−1 comparisons to find maximum element of 'n ' 9 elements in binary heap. So, it will take [992]−1 = 49 comparisons.

Suggest Corrections
0
Join BYJU'S Learning Program
Related Videos
Empty Set
MATHEMATICS
Watch in App
Explore more
Join BYJU'S Learning Program