Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
m-ary tree
open-in-new
<p>In <a href="/facts/Graph_theory/VVPCd4TX">graph theory</a>, an <i>m</i>-ary tree (for nonnegative integers <i>m</i>) (also known as <i>n</i>-ary, <i>k</i>-ary or <i>k</i>-way tree) is an <a href="/facts/Arborescence_(graph_theory)/qFKvoaLJ">arborescence</a> (or, for some authors, an <a href="/facts/Ordered_tree/TCWk4Joy">ordered tree</a>) in which each node has no more than <i>m</i> children. A <a href="/facts/Binary_tree/TDV7GMpu">binary tree</a> is an important case where <i>m</i> = 2; similarly, a <a href="/facts/Ternary_tree/WvNM5JzM">ternary tree</a> is one where <i>m</i> = 3. </p>