Why would a recursive implementation fail in skew heaps?

Category: QuestionsWhy would a recursive implementation fail in skew heaps?
Editor">Editor Staff asked 1 month ago

Why would a recursive implementation fail in skew heaps?
 
(a) skew heaps are self adjusting
 
(b) efficiency gets reduced
 
(c) lack of stack space
 
(d) time complexity
 
My query is from Heap topic in portion Heap of Data Structures & Algorithms I
 
The question was posed to me in class test.

1 Answers
Editor">Editor Staff answered 1 month ago

Correct answer is (c) lack of stack space
 
For explanation: In skew heaps, a recursive implementation could fail because of lack of stack space even though performance is acceptable.