NIST

(a,b)-tree

(data structure)

Definition: A search tree with the restrictions that all leaves are at the same depth and all internal nodes have between a and b children, where a and b are integers such that 2 ≤ a ≤ (b+1)/2. The root may have as few as 2 children.

Generalization (I am a kind of ...)
search tree.

Specialization (... is a kind of me.)
B-tree with 1 ≤ a.

Note: After Algorithms and Theory of Computation Handbook, page 4-18, CRC Press LLC.

Author: PEB


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 6 October 2004.
HTML page formatted Fri Feb 23 10:06:07 2018.

Cite this as:
Paul E. Black, "(a,b)-tree", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 6 October 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/abtree.html