+1 vote
in Data Structures & Algorithms I by (88.2k points)
What is the amortized cost per operation of a skew heap?

(a) O(N)

(b) O(N log N)

(c) O(N^2)

(d) O(log N)

My question is from Heap in division Heap of Data Structures & Algorithms I

The question was asked in quiz.

1 Answer

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

For explanation: The amortized cost per operation of a skew heap is O(log N) since the worst case analysis of skew heap is O(N) and splay tree is O(M 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.