+1 vote
in Data Structures & Algorithms I by (88.2k points)
___________ is a self-adjusting version of a leftist heap.

(a) Rightist heap

(b) Skew heap

(c) d-heap

(d) Binary heap

This interesting question is from Heap in portion Heap of Data Structures & Algorithms I

I had been asked this question during an interview for a job.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct option is (b) Skew heap

The best I can explain: A skew heap is a self-adjusting version of a leftist heap and it is simpler to implement.

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.