A 2-3 tree is a type of data structure with following properties. All data appears at the leaves. Data elements are ordered from left (minimum) to right (maximum). Every path through the tree is the same length. Interior nodes have 2 or 3 subtrees.
