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

Category: QuestionsWhat is the time taken to delete a minimum element in a leftist heap?
Editor">Editor Staff asked 4 weeks ago

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)
 
(d) O(M log N)
 
My enquiry is from Heap in portion Heap of Data Structures & Algorithms I
 
This question was posed to me in my homework.

1 Answers
Editor">Editor Staff answered 4 weeks ago

Correct answer is (c) O(log N)
 
The explanation is: The time taken to delete a minimum element in a leftist heap is mathematically found to be O(log N).