CameraIcon
CameraIcon
SearchIcon
MyQuestionIcon
MyQuestionIcon
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!
Join BYJU'S Learning Program
CrossIcon