+1 vote
in Data Structures & Algorithms I by (88.2k points)
What is the time per operation of merging, insertion and deletion operations in a skew heap?

(a) O(N)

(b) O(log N)

(c) O(N log N)

(d) O(N^2)

I need to ask this question from Heap topic in division Heap of Data Structures & Algorithms I

This question was posed to me during an interview.

1 Answer

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

Best explanation: Skew heaps support merging, insertion and deletion all effectively in O(log N) time per operation.

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

...