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