Vidyalelo
Data Structure · Q21

Heaps

Programming · Data Structure · question 21

Q21

In a binary heap, what is the typical time complexity of deleting an arbitrary element?

A.
O(1)
B.
O(log n)
C.
O(n)
Answer
D.
O(n log n)

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board