2-3 Tree
1. A 2-3 tree is a perfectly balanced binary search tree.
2. Data items are arranged in a sorted order in a 2-3 tree. In a 3-node, the data item of the middle node is greater than the data item of the root node. What about the data item of the right node?
3. Which of the following is the optimal data structure choice for implementation of searching operation?
4. What advantage do 2-3 trees have over normal binary search trees?
5. Which of the following traversals would ensure that the elements are obtained in sorted order in a 2-3 tree?
6. 2-3 trees provide better insertion than AVL trees.