+1 vote
in Data Structures & Algorithms I by (88.2k points)
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 Answer

+1 vote
by (672k points)
selected by
 
Best answer
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).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...