Question

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.

Answer 1

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.