COSC 2007  Data Structures II 2-3 Search Tree 2-3 trees are data structures commonly used to implement ordered lists of records(or tables). A 2-3 tree is a tree satisfying the following requirements All internal nodes in the tree have either two or three children.  All leaves of the tree are at the same level.The 2-3 tree is also a search tree like the binary search tree, but this tree tries to solve the problem of the unbalanced tree The following link is useful to understand how 2-3 trees works: Java applet illustrating 2-3 tree... More