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:
“The pine tree seems to listen, the fir tree seems to wait, and neither with impatience:Mthey give no thought to the little people below them whose impatience and curiosity eat them up alive.”
—Friedrich Nietzsche (1844–1900)