(a,b)-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 . 
<triplet> nodes <subj> leaves <obj> part of