##### Wikipedia

**(a,b)-tree**

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

An (a,b)-tree has all of its leaves at the same depth, and all internal nodes except for the root have between and children, where and are integers such that . The root has, if it is not a leaf, between 2 and children.