it should be log n as worst case would be deleting the minimum element first, we will swap it with last and then delete and then apply downheapify to height logn
Complexity of deleting element in min heap
Yes… the complexity to delete an element in a heap is O(log n).
There are some issue with the quiz/mcq section so…some answers may be marked wrong.
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.