2-3 trees
A 2-3 tree is a type of balanced search tree in computer science. It is characterized by nodes that can have either two or three child nodes. In a 2-3 tree, all leaf nodes are at the same level, and the paths from the root to the leaf nodes have equal length. This balanced structure ensures efficient searching, insertion, and deletion operations with a worst-case time complexity of O(log n), where n is the number of elements stored in the tree.
Requires login.