K-ary tree

From Wikipedia, the free encyclopedia

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.

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

For a k-ary tree with height h, the upper bound for the maximum number of leaves is k^h.

[edit] External links

• N-ary trees, Bruno R. Preiss, P.Eng.

This computer science article is a stub. You can help Wikipedia by expanding it.