(a,b)-tree

From Cosmopedia
Jump to: navigation, 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 have between <math>a</math> and <math>b</math> children, where <math>a</math> and <math>b</math> are integers such that <math>2 \le a \le (b+1)/2</math>. The root may have as few as 2 children.

See also

B-tree

Template:DADSTemplate:Compsci-stub

cs:(a,b)-strom