Formally, a 2–3 tree of height h is one of the following 1. a single node (in which case h = 0, and the node is called a leaf); or 2. a node with 2 subtrees, both of which are 2–3 trees of height h −...

Formally, a 2–3 tree of height h is one of the following

1. a single node (in which case h = 0, and the node is called a leaf); or

2. a node with 2 subtrees, both of which are 2–3 trees of height h − 1; or

3. a node with 3 subtrees, all three of which are 2–3 trees of height h − 1