+1 vote
in Data Structures & Algorithms I by (110k points)
Which of the following is a self – balancing binary search tree?

(a) 2-3 tree

(b) Threaded binary tree

(c) AA tree

(d) Treap

Question is from Binary Trees in portion Binary Trees of Data Structures & Algorithms I

The question was posed to me during an online exam.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Right option is (c) AA tree

Easiest explanation - An AA tree, which is a variation of red-black tree, is a self – balancing binary search tree. 2-3 is B-tree of order 3 and Treat is a randomized binary search tree. A threaded binary tree is not a balanced tree.

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

...