Q4. Complexity Of Heap Operation
Which of the following Binary Min Heap operation has the highest time complexity?
Inserting an item under the assumption that the heap has capacity to accommodate one more item
Deleting an item from heap
Merging with another heap under the assumption that the heap has capacity to accommodate items of other heap
Decreasing value of a key
Q10. Decrease Value In A Heap Time taken in decreasing the node value in a binomial heap is O(1) O(logN) O(N) Prev
The merge operation takes O(n) time, all other operations given in question take O(Logn) time.
O(logn)
Decreasing a node value may result in violating the min property. As a result be there would be exchange in the value of parent and child which at max goes up to height of the heap.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.