+1 vote
in Data Structures & Algorithms I by (110k points)
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 Answer

+1 vote
by (672k points)
selected by
 
Best answer
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.

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

...