The worst case running time of all operations in a skew heap is given as?

Category: QuestionsThe worst case running time of all operations in a skew heap is given as?
Editor">Editor Staff asked 4 weeks ago

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 Answers
Editor">Editor Staff answered 4 weeks ago

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).