m-ary tree - Wikipedia
https://en.wikipedia.org/wiki/M-ary_tree
OverviewTypes of m-ary treesTraversal methods for m-ary treesConvert a m-ary tree to binary treeEnumeration of m-ary treesApplicationSee alsoExternal linksIn 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) in which each node has no more than m children. A binary tree is the special case where m = 2, and a ternary tree is another case with m = 3 that limits its children to three. tumblr
tumblr
DA: 27 PA: 53 MOZ Rank: 53