Subtrees are children's

1 files changed, 4 insertions, 4 deletions

diff --git a/mgr.tex b/mgr.tex
index 0f6f97a..f4bbb74 100644
--- a/mgr.tex
+++ b/mgr.tex
@@ -220,7 +220,7 @@ 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.
+    \item First traverse the root's children's subtrees.
     \item Visit the root.
 \end{enumerate}
 
@@ -229,15 +229,15 @@ recursive procedure:
 
 \begin{enumerate}
     \item First visit the root.
-    \item Traverse the root's subtrees.
+    \item Traverse the root's children's subtrees.
 \end{enumerate}
 
 Finally, the following procedure produces the \definedterm{in-order} of $V(T)$:
 
 \begin{enumerate}
-    \item First traverse the left subtree.
+    \item First traverse the left child's subtree.
     \item Visit the root.
-    \item Traverse the right subtree.
+    \item Traverse the right child's subtree.
 \end{enumerate}
 
 \subsection{Tree automata}