(a,b)-tree

From Wikipedia, the free encyclopedia

In computer science, an (a,b) tree is a specific kind of search tree.

An (a,b) tree has all of its leaves at the same depth, and all internal nodes have between a and b children, where a and b are integers such that 2 \le a \le (b+1)/2. The root may have as few as 2 children.

[edit] See also

B-tree

Paul E. Black, (a,b)-tree at the NIST Dictionary of Algorithms and Data Structures.

Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../%28/a/%2C/%28a%2Cb%29-tree.html"
In other languages