(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
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 6 October 2004.
HTML page formatted Wed Mar 13 12:42:45 2019.
Cite this as:
Paul E. Black, "(a,b)-tree", in
Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 6 October 2004. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/abtree.html