diff --git a/content/concurrency.article b/content/concurrency.article
index b6bd509..35945b0 100644
--- a/content/concurrency.article
+++ b/content/concurrency.article
@@ -94,7 +94,7 @@
 
 * Exercise: Equivalent Binary Trees
 
-There can be many different binary trees with the same sequence of values stored at the leaves. For example, here are two binary trees storing the sequence 1, 1, 2, 3, 5, 8, 13.
+There can be many different binary trees with the same sequence of values stored in it. For example, here are two binary trees storing the sequence 1, 1, 2, 3, 5, 8, 13.
 
 .image /content/img/tree.png