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:
“Blessed is the man that walketh not in the counsel of the ungodly,
nor standeth in the way of sinners, nor sitteth in the seat of the
scornful.
But his delight is in the law of the Lord; and in his law doth he
meditate day and night.
And he shall be like a tree planted by the rivers of water, that
bringeth forth his fruit in his season; his leaf also shall not wither;
and whatsoever he doeth shall prosper.”
—Bible: Hebrew Psalm I (l. I, 1–3)