Q: What is the time complexity of deleting the minimum element from a binary heap of n elements?
-
A
O(n)
-
B
O(log n)
-
C
O(n log n)
-
D
O(1)
B
Answer:
B
Explanation:
Answer: b) O(log n)
Explanation: The time complexity of deleting the minimum element from a binary heap of n elements is O(log n).
Related Topic:
Share Above MCQ