K-ary tree

Encyclopedia : K : KA : KAR : K-ary tree

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. A binary tree is the special case where k=2.

A full k-ary tree is a k-ary tree where each node has either 0 or k children.

From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.