From e03875da21dbc53e4ab69e3d1c05e1a55413d814 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Eray=20G=C3=BCndo=C4=9Fmu=C5=9F?=
 <74984741+eraygundogmus@users.noreply.github.com>
Date: Mon, 13 Sep 2021 13:02:22 +0300
Subject: [PATCH] Update tree-intro.asc

---
 book/content/part03/tree-intro.asc | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/book/content/part03/tree-intro.asc b/book/content/part03/tree-intro.asc
index 80d65903..94f4b88b 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]