Which is the simplest of all binary search trees?

Category: QuestionsWhich is the simplest of all binary search trees?
Editor">Editor Staff asked 3 months ago

Which is the simplest of all binary search trees?
 
(a) AVL tree
 
(b) Treap
 
(c) Splay tree
 
(d) Binary heap
 
The origin of the question is Binary Trees topic in division Binary Trees of Data Structures & Algorithms I
 
The question was asked in my homework.

1 Answers
Editor">Editor Staff answered 3 months ago

The correct option is (b) Treap
 
Easiest explanation – A treap is the simplest of all binary search trees. Each node is given a numeric priority and implementation is non recursive.