Which of the following tree data structures is not a balanced binary tree?

Category: QuestionsWhich of the following tree data structures is not a balanced binary tree?
Editor">Editor Staff asked 4 weeks ago

Which of the following tree data structures is not a balanced binary tree?
 
(a) AVL tree
 
(b) Red-black tree
 
(c) Splay tree
 
(d) B-tree
 
I would like to ask this question from Binary Trees in portion Binary Trees of Data Structures & Algorithms I
 
This question was addressed to me during an interview.

1 Answers
Editor">Editor Staff answered 4 weeks ago

Right choice is (d) B-tree
 
For explanation: All the tree data structures given in options are balanced, but B-tree can have more than two children.