Topics: Graph Theory - Tree


(definition)

An -ary tree is an ordered tree that has, at most, children.

We say it is a regular -ary tree if every one of its children has exactly children.