+1 vote
in Data Structures & Algorithms I by (110k points)
2-3 tree is a specific form of _________

(a) B – tree

(b) B+ – tree

(c) AVL tree

(d) Heap

Question is taken from B-Trees topic in division B-Trees of Data Structures & Algorithms I

I had been asked this question during an interview.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right option is (a) B – tree

Best explanation: The 2-3 trees is a balanced tree. It is a specific form the B – tree. It is B – tree of order 3, where every node can have two child subtrees and one key or 3 child subtrees and two keys.

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.