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:
“Captain, it is I, Ensign Pulver. And I just threw your stinking palm tree overboard. Now what’s all this crud about no movie tonight?”
—Frank S. Nugent (1908–1965)