From f157985fa251ba12be0cbf2ec7b1d1ce29aea5c0 Mon Sep 17 00:00:00 2001
From: Tony Yang <38984697+tonyyzy@users.noreply.github.com>
Date: Wed, 2 Feb 2022 02:11:10 +0000
Subject: [PATCH] Fix minor typo

---
 latex/binarytrees.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/latex/binarytrees.tex b/latex/binarytrees.tex
index 5f4b0c37..9b992724 100644
--- a/latex/binarytrees.tex
+++ b/latex/binarytrees.tex
@@ -8,7 +8,7 @@ \chapter{Binary Trees}
 \index{binary tree}%
 here comes from
 the fact that, when we draw them, the resultant drawing often resembles
-the trees found in a forest.  There are many ways of ways of defining
+the trees found in a forest.  There are many ways of defining
 binary trees.  Mathematically, a \emph{binary tree} is a connected,
 undirected, finite graph with no cycles, and no vertex of degree greater
 than three.