M-ary Tree

In graph theory, an ''m''-ary tree (also known as ''n''-ary, ''k''-ary or ''k''-way tree) is a rooted 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.

Types of ''m''-ary trees

* A full ''m''-ary tree is an ''m''-ary tree where within each level every node has either 0 or ''m'' children.
* A complete ''m''-ary tree is an ''m''-ary tree which is maximally space efficient. It must be completely filled on every level except for the last level. However, if the last level is not complete, then all nodes of the tree must be "as far left as possible".
* A perfect ''m''-ary tree is a full ''m''-ary tree in which all leaf nodes are at the same depth.

Properties of ''m''-ary trees

* For an ''m''-ary tree with height ''h'', the upper bound for the maximum number of leaves is $m^h$.
* The height ''h ''of an ''m''-ary tree does not include the root node, with a tree containing only a root node having a height of 0.
* The height of a tree is equal to the maximum depth ''D'' of any node in the tree.
* The total number of nodes $N$ in a perfect ''m''-ary tree is $\sum_^h m^i = \frac$, while the height ''h'' is \begin
& \frac \geq N > \frac \\ pt& m^ \geq (m - 1) \cdot N + 1 > m^h \\ pt& h+1 \geq \log_m \left((m - 1) \cdot N + 1\right) > h \\ pt& h \ge \left\lceil\log_m ((m - 1) \cdot N + 1) - 1\right\rceil.
\end By the definition of Big-Ω, the maximum depth $D = h \ge \left\lceil\log_m ((m - 1) \cdot N + 1) - 1\right\rceil =O(\log_m n) = O(\log n/\log m)$
* The height of a complete ''m''-ary tree with ''n'' nodes is $\lfloor \log_m ((m-1)\cdot n) \rfloor$.
* The total number of possible ''m''-ary tree with ''n'' nodes is $C_n = \frac \cdot \binom$ (which is a Catalan number).

Traversal methods for ''m-''ary trees

Traversing a ''m''-ary tree is very similar to binary tree traversal. The pre-order traversal goes to parent, left subtree and the right subtree, and for traversing post-order it goes by left subtree, right subtree, and parent node. For traversing in-order, since there are more than two children per node for ''m > 2'', one must define the notion of ''left'' and ''right'' subtrees. One common method to establish left/right subtrees is to divide the list of children nodes into two groups. By defining an order on the ''m'' children of a node, the first $\$ nodes would constitute the left subtree and $\$ nodes would constitute the right subtree.

Convert a ''m''-ary tree to binary tree

Using an array for representing a ''m-''ary tree is inefficient, because most of the nodes in practical applications contain less than ''m'' children. As a result, this fact leads to a sparse array with large unused space in the memory. Converting an arbitrary ''m-''ary tree to a binary tree would only increase the height of the tree by a constant factor and would not affect the overall worst-case time complexity. In other words, $O(\log_m n)\equiv O(\log_2 n)$ since $\log_2 m \cdot \log_m n =\frac \cdot \frac = \log_2 n$.

First, we link all the immediate children nodes of a given parent node together in order to form a link list. Then, we keep the link from the parent to the first (i.e., the leftmost) child and remove all the other links to the rest of the children. We repeat this process for all the children (if they have any children) until we have processed all the internal nodes and rotate the tree by 45 degrees clockwise. The tree obtained is the desired binary tree obtained from the given ''m''-ary tree.

Methods for storing ''m''-ary trees

Arrays

''m''-ary trees can also be stored in breadth-first order as an implicit data structure in arrays, and if the tree is a complete ''m''-ary tree, this method wastes no space. In this compact arrangement, if a node has an index ''i'', its ''c''-th child in range is found at index $m\cdot i+c$, while its parent (if any) is found at index ''$\left \lfloor \frac \right \rfloor$'' (assuming the root has index zero, meaning a 0-based array). This method benefits from more compact storage and better locality of reference, particularly during a preorder traversal. The space complexity of this method is $O(m^n)$.

Pointer-based

Each node would have an internal array for storing pointers to each of its $m$ children:

Compared to array-based implementation, this implementation method has superior space complexity of $O(m\cdot n)$.

Enumeration of ''m-''ary trees

Listing all possible ''m''-ary trees are useful in many disciplines as a way of checking hypothesis or theories.
Proper representation of ''m-''ary tree objects can greatly simplify the generation process. One can construct a ''bit sequence representation'' using the depth-first search of a ''m''-ary tree with ''n'' nodes indicating the presence of a node at a given index using binary values. For example, the bit sequence ''x=1110000100010001000'' is representing a 3-ary tree with ''n=6'' nodes as shown below.

The problem with this representation is that listing all bit strings in lexicographic order would mean two successive strings might represent two trees that are lexicographically very different. Therefore, enumeration over binary strings would not necessarily result in an ordered generation of all ''m-''ary trees. A better representation is based on an integer string that indicates the number of zeroes between successive ones, known as ''Simple Zero Sequence''. $S= s_1, s_2, \dots , s_$ is a Simple Zero Sequence corresponding to the bit sequence $10^10^\ldots 10^10^j$ where ''j'' is the number of zeroes needed at the tail end of the sequence to make the string have the appropriate length. For example, $1110000100010001000 \equiv 10^0 10^0 10^4 10^4 10^3 \equiv 00433$ is the simple zero sequence representation of the above figure. A more compact representation of ''00433'' is $0^2 4^1 3^2$, which is called ''zero sequence'', which duplicate bases cannot be adjacent. This new representation allows to construct a next valid sequence in $O(1)$.
A simple zero sequence is valid if
$\sum_^ s_i \le (m-1)j \qquad \forall j \le n-1.$That is to say that number of zeros in the bit sequence of a ''m''-ary tree cannot exceed the total number of null pointers (i.e., pointers without any child node attached to them). This summation is putting restriction on $n-1$ nodes so that there is room for adding the $n^th$ without creating an invalid structure (i.e. having an available null pointer to attached the last node to it).

The table below shows the list of all valid simple zero sequences of all ''3''-ary trees with 4 nodes:

Starting from the bottom right of the table (i.e., "000"), there is a ''backbone template'' that governs the generation of the possible ordered trees starting from "000" to "006". The backbone template for this group ("00X") is depicted below, where an additional node is added in the positions labeled "x".

Once one has exhausted all possible positions in the backbone template, a new template will be constructed by shifting the 3rd node one position to the right as depicted below, and the same enumeration would occur until all possible positions labeled "X" is exhausted.

Going back to the table of enumeration of all ''m''-ary trees, where $m=3$ and $n=4$, we can easily observe the apparent jump from "006" to "010" can be explained trivially in an algorithmic fashion as depicted below:

The pseudocode for this enumeration is given below:

Procedure NEXT(''s''₁, ''s''₂, …, ''s''_''n''−1)
if ''s_i'' = 0 for all ''i'' then
finished
else
''i'' ← max
''s_i'' ← ''s_i'' − 1
if ''i'' < ''n'' − 1 then
''s_i'' ← (''i'' + 1) ⋅ (''m'' − 1) − sum(''s_j'')
end if
for ''j'' ← ''i'' + 2, ''i'' + 3, …, ''n'' − 1
''s_j'' ← ''k'' − 1
end if
end

Loopless enumeration

A generation algorithm that takes $O(1)$ worst-case time are called loopless since the time complexity cannot involve a loop or recursion. Loopless enumeration of ''m-''ary trees is said to be loopless if after initialization, it generates successive tree objects in $O(1)$. For a given a ''m-''ary tree ''T'' with $a$ being one of its nodes and $d$ its $t$-th child, a ''left-t rotation'' at $a$ is done by making $d$ the root node, and making $b$ and all of its subtrees a child of $a$, additionally we assign the $m-1$ left most children of $d$ to $a$ and the right most child of $d$ stays attached to it while $d$ is promoted to root, as shown below:

Convert an m-ary tree to left-tree
for ''i'' = 1...''n'':
for ''t'' = 2...''m'':
while ''t'' child of node at depth ''i'' ≠ 1:
L-t rotation at nodes at depth ''i''
end while
end for
end for

A ''right-t rotation'' at ''d'' is the inverse of this operation. The ''left chain'' of ''T'' is a sequence of $x_, x_, \dots, x_$ nodes such that $x_1$ is the root and all nodes except $x_$ have one child connected to their left most (i.e., m /math>) pointer. Any ''m-''ary tree can be transformed to a ''left-chain'' tree using sequence of finite ''left-t rotations'' for ''t'' from ''2'' to ''m''. Specifically, this can be done by performing left-t rotations on each node $x_i$ until all of its $m-1$ sub-tree become ''null'' at each depth. Then, the sequence of number of left-t rotations performed at depth ''i'' denoted by $c_i$ defines a ''codeword'' of a ''m-''ary tree that can be recovered by performing the same sequence of right-t rotations.

Let the $m-1$ tuple of $c_1, c_2, \dots ,c_$ represent the number of ''L-2'' rotations, ''L-3'' rotations, ..., ''L-m'' rotations that has occurred at the root (i.e., ''i''=1).Then, $c_$ is the number of ''L-t'' rotations required at depth ''i''.

Capturing counts of left-rotations at each depth is a way of encoding an ''m''-ary tree. Thus, enumerating all possible legal encoding would helps us to generate all the ''m''-ary trees for a given ''m'' and ''n''. But, not all $c_i$ sequences of ''m'' non-negative integers represent a valid m-ary tree. A sequence of $(n-1) \cdot (m-1) + 1$ non-negative integers is a valid representation of a ''m-''ary tree if and only if
$\sum_^ \sum_^ c_ \qquad \le n-j ,\qquad \forall j \in 0 \dots n.$

Lexicographically smallest code-word representation of a ''m-ary'' with ''n'' nodes is all zeros and the largest is ''n''−1 ones followed by ''m''−1 zero on its right.

Initialization
c to zero for all i from 1 to ''n''⋅(''k'' − 1)
p set to ''n'' − 1 for i from 1 to n
''sum'' ← 0
''j'' ← ''m'' − 1

Termination Condition
Terminate when c = ''n'' − 1

Procedure NEXT
''sum'' ← ''sum'' + 1 − ''c'' 'j'' + 1 ''c'' ← ''c'' 'j''+ 1
if ''p'' 'q''[''j'' > ''p''[''q''[''j'' + 1">'j''.html" ;"title="'q''[''j''">'q''[''j'' > ''p''[''q''[''j'' + 1 + 1 then
''p'' 'q''[''j'' ← ''p''[''q''[''j'' + 1 + 1
end if
''p''[''q''[''j'' + ''c''[''j''] ← ''p'' 'q''[''j''
''c''[''j'' + 1] ← 0
if ''sum'' = ''p'' 'q''[''j'' then
''j'' ← ''j'' − 1
else
''p''[''n''">'j''.html" ;"title="'q''[''j''">'q''[''j'' then
''j'' ← ''j'' − 1
else
''p''[''n''← ''sum''
''j'' ← ''m'' − 1
end if
end

Application

One of the applications of ''m''-ary tree is creating a dictionary for validation of acceptable strings. In order to do that, let ''m'' be equal to the number of valid alphabets (e.g., number of letters of the English alphabet) with the root of the tree representing the starting point. Similarly, each of the children can have up to ''m'' children representing the next possible character in the string. Thus, characters along the paths can represent valid keys by marking the end character of the keys as "terminal node". For example, in the example below "at" and "and" are valid key strings with "t" and "d" marked as terminal nodes. Terminal nodes can store extra information to be associated with a given key. There are similar ways to building such a dictionary using B-tree, Octree and/or trie.

See also

* Branching factor
* Left-child right-sibling binary tree
* Binary tree

References

*

External links

''N''-ary trees, Bruno R. Preiss, Ph.D, P.Eng.

{{CS-Trees

Trees (graph theory)
Trees (data structures)