Editing B-tree (section)

===(a,b)-tree===
(a,b)-trees are generalizations of B-trees. B-trees require that each internal node have a minimum of <math>\lfloor K / 2 \rfloor + 1</math> children and a maximum of <math>K</math> children, for some preset value of <math>K</math>. In contrast, an (a,b)-tree allows the minimum number of children for an internal node to be set arbitrarily low. In an (a,b)-tree, each internal node has between {{mvar|a}} and {{mvar|b}} children, for some preset values of {{mvar|a}} and {{mvar|b}}.