2-3 Trees §

---

A tree, where every internal node has either:

• two children and one data element (2-node); or
• three children and two data elements (3-node).

Leaf nodes have no children and one or two data elements.

2-3 trees are required to be balanced.