NAT2 marks
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 __________.
Numerical answer
Answer key coming soon
GATE CSE previous year questions · Programming & Data Structures
Numerical answer
Answer key coming soon