An operator delete(i) for a binary heap data structure is to be designed to delete the item in the i-th node. Assume that the heap is implemented in an array and i refers to the i-th index of the array. If the heap tree has depth d (number of edges on the path from the root to the farthest leaf), then what is the time complexity to re-fix the heap efficiently after the removal of the element?

Question

Examsnet · Accepted Answer

Correct Answer is : O(d) but not O(1)

GATE Computer Science (CS) 2016 Shift 1 Solved Paper