About this document
Understanding 2-3 Tree Nodes by Jose Ramon Sandoval Jimenez is a document available to read on EtoBox.
A 2-3 tree is a type of data structure where every internal node has either two children and one data element (2-node), or three children and two data elements (3-node). Leaf nodes have no children and one or two data elements. 2-3 trees are balanced, with each subtree containing the same or close to the same amount of data, and are equivalent to AA trees, meaning the same data can be represented in either structure.
- Author
- Jose Ramon Sandoval Jimenez
- Language
- EN