Editor">
Editor Staff asked 5 months ago
Editor Staff asked 5 months ago
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 Answers
Editor">Editor Staff answered 5 months ago
Editor Staff answered 5 months ago
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.
