+1 vote
in Data Structures & Algorithms I by (88.2k points)
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 Answer

+1 vote
by (672k points)
selected by
Best answer
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.

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.