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

(a) AVL Tree

(b) 2-3-4 Tree

(c) Red – Black Tree

(d) Splay Tree

This interesting question is from Binary Trees in chapter Binary Trees of Data Structures & Algorithms I

This question was addressed to me in unit test.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct choice is (b) 2-3-4 Tree

The best I can explain: 2-3-4 Tree is balanced search trees. But it is not a binary tree. So, it is not a self balancing binary tree. AVL tree, Red-Black Tree and Splay tree are self balancing binary search 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.