Vidyalelo
Data Structure · Q151

Heaps

Programming · Data Structure · question 151

Q151

What is the time taken to delete a minimum element in a leftist heap?

A.
O(N)
B.
O(N log N)
C.
O(log N)
Answer
D.
O(M log N)

Answer: Option C

Solution

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