+1 vote
in Data Structures & Algorithms I by (110k points)
Which of the following is not true about the 2-3 tree?

(a) all leaves are at the same level

(b) it is perfectly balanced

(c) postorder traversal yields elements in sorted order

(d) it is B-tree of order 3

My question comes from B-Trees in section B-Trees of Data Structures & Algorithms I

I have been asked this question in class test.

1 Answer

+1 vote
by (737k points)
selected by
 
Best answer
Right choice is (c) postorder traversal yields elements in sorted order

Explanation: In a 2-3 tree, leaves are at the same level. And 2-3 trees are perfectly balanced as every path from root node to the null link is of equal length. In 2-3 tree in-order traversal yields elements in sorted order.

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

...