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. A binary tree is the special case where k=2.
Read more about K-ary Tree: Types of K-ary Trees, Properties of K-ary Trees
Famous quotes containing the word tree:
“I have come to the conclusion that the closer people are to what may be called the front lines of government ... the easier it is to see the immediate underbrush, the individual tree trunks of the moment, and to forget the nobility the usefulness and the wide extent of the forest itself.... They forget that politics after all is only an instrument through which to achieve Government.”
—Franklin D. Roosevelt (18821945)