2-3 tree

From Wikipedia, the free encyclopedia

2-3 tree in computer science is a B-tree that can contain only 2-nodes (a node with 1 element and 2 children) and 3-nodes (a node with 2 elements and 3 children).

2-3 trees are an isometry of AA trees, meaning that they are equivalent data structures. In other words, for every 2-3 tree, there exists at least one AA tree with data elements in the same order.

[edit] See also

• B-tree
• AA tree (a 2-3 tree implemented using a binary tree)
• 2-3-4 tree

[edit] External links

• B-Tree animation (Java Applet)