+1 vote
in Data Structures & Algorithms I by (110k points)
Which of the following is false?

(a) 2-3 tree requires less storage than the BST

(b) lookup in 2-3 tree is more efficient than in BST

(c) 2-3 tree is shallower than BST

(d) 2-3 tree is a balanced tree

The above asked question is from B-Trees in chapter B-Trees of Data Structures & Algorithms I

This question was posed to me in quiz.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Correct choice is (a) 2-3 tree requires less storage than the BST

Best explanation: Search is more efficient in the 2-3 tree than in BST. 2-3 tree is a balanced tree and performs efficient insertion and deletion and it is shallower than BST. But, 2-3 tree requires more storage than the BST.

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

...