diff --git a/book/content/part03/tree-intro.asc b/book/content/part03/tree-intro.asc
index 80d6590..94f4b88 100644
--- a/book/content/part03/tree-intro.asc
+++ b/book/content/part03/tree-intro.asc
@@ -106,6 +106,6 @@ image::image35.png[image,width=258,height=169]
 
 .Heap vs. Binary Search Tree
 ****
-Heap is better at finding max or min values in constant time *O(1)*, while a balanced BST is good a finding any element in *O(log n)*. Heaps are often used to implement priority queues, while BST is used when you need every value sorted.
+Heap is better at finding max or min values in constant time *O(1)*, while a balanced BST is good at finding any element in *O(log n)*. Heaps are often used to implement priority queues, while BST is used when you need every value sorted.
 ****
 indexterm:[Runtime, Logarithmic]