What is the worst-case time complexity of inserting an element in a heap of…
2026
What is the worst-case time complexity of inserting an element in a heap of size n ?
Answer: B. O(log n) — The worst-case time complexity of inserting an element in a heap of size n is O(log n).
- A.
O(1)
- B.
O(log n)
- C.
O(n)
- D.
O(n log n)
Attempted by 332 students.
Show answer & explanation
Correct answer: B
The worst-case time complexity of inserting an element in a heap of size n is O(log n).
Loading lesson…