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:
“On a tree by a river a little tom-tit
Sang “Willow, titwillow, titwillow!”
And I said to him, “Dicky-bird, why do you sit
Singing, ‘Willow, titwillow, titwillow’?
Is it a weakness of intellect, birdie?” I cried,
“Or a rather tough worm in your little inside?””
—Sir William Schwenck Gilbert (1836–1911)