Computer Sciences > GATE 2021 SET-2 > Heaps
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 element in H?
Correct : c
Similar Questions
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
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
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......