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.
Search
Topics: Graph Theory - Tree
(definition)
An m-ary tree is an ordered tree that has, at most, m children.
We say it is a regular m-ary tree if every one of its children has exactly m children.