+1 vote
in Data Structures & Algorithms I by (88.2k points)
What is the efficiency of merge used in leftist heaps?

(a) O(N)

(b) O(N log N)

(c) O(M log N)

(d) O(log N)

Origin of the question is Heap topic in division Heap of Data Structures & Algorithms I

The question was posed to me in an interview for job.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Correct answer is (d) O(log N)

The best explanation: The efficiency of merge operations in leftist heap is mathematically found to be O( log N) which is the same in binary heaps.

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

...