m-ary tree
Tree data structure in which each node has at most m children. / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about m-ary tree?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
In graph theory, an m-ary tree (for nonnegative integers m) (also known as n-ary, k-ary or k-way tree) is an arborescence (or, for some authors, an ordered tree)[1][2] in which each node has no more than m children. A binary tree is an important case where m = 2; similarly, a ternary tree is one where m = 3.