4.2-3 Treeยง
- A 2-3 Tree has the following properties:
- A node contains one or two keys
- Every internal node has either two children (if it contains one key) or three children (if it contains two keys).
- All leaves are at the same level in the tree, so the tree is always height balanced.
The 2-3 Tree has a search tree property analogous to the BST.