diff options
-rw-r--r-- | mgr.tex | 4 |
1 files changed, 2 insertions, 2 deletions
@@ -216,8 +216,8 @@ left and the right child). \subsubsection{Tree traversals} -The \definedterm{post-order} of $V(T)$ is an ordering of $T$'s vertices produced -by the following recursive procedure: +Take a binary tree $T$. The \definedterm{post-order} of $V(T)$ is an ordering of +$T$'s vertices produced by the following recursive procedure: \begin{enumerate} \item First traverse the root's subtrees. |