A way to represent a multiway tree as a binary tree. The leftmost child, c, of a node, n, in the multiway tree is the left child, c', of the corresponding node, n', in the binary tree. The immediately right sibling of c is the right child of c'. Formal Definition: A multiway tree T can be represented by a corresponding binary tree B. Let (n₁,..., n_k) be nodes of the multiway tree, T. Let (n'₁,..., n'_k) be nodes of the corresponding binary tree B. Node n_k corresponds to n'_k. In particular, nodes n_k and n'_k have the same labels and if n_k is the root of T, n'_k is the root of B. Connections correspond as follows:

• If n_l is the leftmost child of n_k, n'_l is the left child of n'_k. (If n_k has no children, n'_k has no left child.)
• If n_s is the next (immediately right) sibling of n_k, n'_s is the right child of n'_k.