A 2-3 tree is a type of balanced search tree where every internal node can have 2 or 3 children and store 1 or 2 keys. There are 2 specific node types, 2 and 3 nodes. 2 nodes have 1 key, and exactly 2 children. 3 nodes have 2 keys, and exactly 3 children.
Insert a Numerical Value into the text bar, by pressing the insert button the value will be inserted below into the 2-3 tree.