e/K-ary tree

Information
has gloss	eng: In graph theory, a k-ary tree is a rooted tree in which each node has no more than k children. It is also sometimes known as a k-way tree, an N-ary tree, or an M-ary tree.
lexicalization	eng: k-ary tree
instance of	c/Trees (graph theory)