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.