Update 6.1.md

Added a single r
cy20lin · Mar 4, 2020 · 22a6ad5 · 22a6ad5
1 parent 7185a9e
commit 22a6ad5
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/docs/Chap06/6.1.md b/docs/Chap06/6.1.md
@@ -14,7 +14,7 @@ Write $n = 2^m − 1 + k$ where $m$ is as large as possible. Then the heap consi
 
 > Show that in any subtree of a max-heap, the root of the subtree contains the largest value occuring anywhere in the subtree.
 
-If there largest element in the subtee were somewhere other than the root, it has a parent that is in the subtree. So, it is larger than it's parent, so, the heap property is violated at the parent of the maximum element in the subtree.
+If there largest element in the subtree were somewhere other than the root, it has a parent that is in the subtree. So, it is larger than it's parent, so, the heap property is violated at the parent of the maximum element in the subtree.
 
 ## 6.1-4