Q16
In a binary heap, which of the following operations is O(log n) in time complexity?
A.
Insert
AnswerB.
Find minimum
C.
Delete minimum
D.
Both Insert and Delete minimum
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board