+1 vote
in Data Structures & Algorithms I by (88.2k points)
The worst case running time of all operations in a skew heap is given as?

(a) O(N)

(b) O(N log N)

(c) O(N^2)

(d) O(M log N)

My query is from Heap topic in section Heap of Data Structures & Algorithms I

The question was posed to me in an online interview.

1 Answer

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

Easiest explanation - The worst case running time of all operations in a skew heap is mathematically found to be O(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

...