Definition:In-Order Traversal of Labeled Tree

Definition
Let $T$ be a binary labeled tree.

In-order traversal of $T$ is an algorithm designed to obtain a string representation of $T$.

The steps are as follows:

Also see

 * Pre-Order Traversal of Labeled Tree