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:
“Everyone who enjoys supposes that the tree was concerned with the fruit, but it was really concerned with the seed.—In this lies the difference between all those who create and those who enjoy.”
—Friedrich Nietzsche (1844–1900)