+1 vote
in Data Structures & Algorithms I by (110k points)
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 Answer

+1 vote
by (672k points)
selected by
Best answer
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.

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.