Which of the following is not the self balancing binary search tree?

Category: QuestionsWhich of the following is not the self balancing binary search tree?
Editor">Editor Staff asked 4 weeks ago

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 Answers
Editor">Editor Staff answered 4 weeks ago

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.