2-3 tree
Encyclopedia : 2 : 23 : 23T : 2-3 tree
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).
a 2-node
a 3-node
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.
See also
- B-tree
- AA tree (a 2-3 tree implemented using a binary tree)
- 2-3-4 tree
External links
From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.