Computer Sciences > GATE 2024 SET-1 > Heaps
Consider a binary min-heap containing 105 distinct elements. Let k be the index (in the underlying array) of the maximum element stored in the heap. The number of possible values of k is
Correct : a
Similar Questions
An array is [82, 101, 90, 11, 111, 75, 33, 131, 44, 93] heapified. Which one of the following options represents the first three elements in the heapified array...
Let H be a binary min-heap consisting of n elements implemented as an array. What is the worst case time complexity of an optimal algorithm to find the maximum...
Consider a max heap, represented by the array:
Now consider that a value 35 is inserted into this heap. After insertion, the new heap is
Total Unique Visitors
Loading......