From d7ff7763a6ae04c61a23e2833b26be03dd19f7f1 Mon Sep 17 00:00:00 2001
From: Marcin Chrzanowski <mc370754@students.mimuw.edu.pl>
Date: Thu, 9 Dec 2021 15:35:51 +0100
Subject: Tree traversals are for binary trees

---
 mgr.tex | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

(limited to 'mgr.tex')

diff --git a/mgr.tex b/mgr.tex
index 2ff3176..0f6f97a 100644
--- a/mgr.tex
+++ b/mgr.tex
@@ -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.
-- 
cgit v1.2.3