Editor">
Editor Staff asked 5 months ago
Editor Staff asked 5 months 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 5 months ago
Editor Staff answered 5 months 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.
