+1 vote
in Data Structures & Algorithms I by (88.2k points)
In what time can a leftist heap be built?

(a) O(N)

(b) O(N log N)

(c) O(log N)

(d) O(M log N)

The query is from Heap topic in portion Heap of Data Structures & Algorithms I

The question was asked in a job interview.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Right choice is (a) O(N)

Best explanation: The mathematical calculation yields a result that, a leftist heap can be built in O(N) time by building a binary heap.

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

...