\begin{definition}[Definition:In-Order Traversal of Labeled Tree]
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:
\end{definition}