In computer science, a 2–3 tree is a tree data structure, where every node with children has either two children and one data element or three children and two data elements. A 2–3 tree is a B-tree of order 3. Nodes on the outside of the tree have... Wikipedia