+1 vote
in Data Structures & Algorithms I by (88.2k points)
The relationship of skew heaps to leftist heaps is analogous to that of?

(a) Splay tree and AVL tree

(b) Red black tree and AVL tree

(c) Binary tree and Splay tree

(d) Binary tree and Red black tree

The origin of the question is Heap topic in chapter Heap of Data Structures & Algorithms I

The question was asked during an internship interview.

1 Answer

+1 vote
by (737k points)
selected by
 
Best answer
Right choice is (a) Splay tree and AVL tree

The best I can explain: Splay tree is a self -adjusting version of AVL tree. Similarly, skew heap is a self-adjusting version of leftist heap.

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.

Categories

...