Important Properties of B(2-3-4) Trees

• All leaves are at the same level.
• All internal nodes have 2, 3, or 4 children.
• All internal nodes have 1, 2, or 3 keys.
• All keys in a node are sorted in increasing order.
• All keys in the left subtree of a key are less than the key.
• All keys in the right subtree of a key are greater than the key.
• All keys in the middle subtree of a key are between the two keys.

Picture of a B(2-3-4) tree