Worst case time complexity to maintain the HEAP property after extracting the…
2026
Worst case time complexity to maintain the HEAP property after extracting the minimum element from a binary MIN-HEAP ?
- A.
θ(n)
- B.
θ(log n)
- C.
θ(n²)
- D.
θ(n log n)
Attempted by 90 students.
Show answer & explanation
Correct answer: B
Extracting the minimum element from a binary min-heap requires replacing the root with the last element and sifting it down to restore the heap property. This process takes O(log n) time in the worst case.