From formulasearchengine
Jump to navigation Jump to search

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 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 b children.


Let such that . Then a tree T is an (a,b) tree when:

Inner node representation

Every inner node has the following representation:

See also