Vidyalelo
Data Structure · Q118

Heaps

Programming · Data Structure · question 118

Q118

The worst case complexity of deleting any arbitrary node value element from heap is . . . . . . . .

A.
O(logn)
Answer
B.
O(n)
C.
O(nlogn)
D.
O(n2)

Answer: Option A

Solution

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