From 7a349616a195c856a48ff8cef968f4c787282123 Mon Sep 17 00:00:00 2001
From: Michael Zegar <85312805+3centroids@users.noreply.github.com>
Date: Fri, 27 Oct 2023 16:26:30 +0200
Subject: [PATCH] grammar

... Segment Tree, such that it corresponds...
---
 src/data_structures/segment_tree.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/data_structures/segment_tree.md b/src/data_structures/segment_tree.md
index 9dfd62075..d9760bdd5 100644
--- a/src/data_structures/segment_tree.md
+++ b/src/data_structures/segment_tree.md
@@ -138,7 +138,7 @@ And if we stop partitioning whenever the query segment coincides with the vertex
 ### Update queries
 
 Now we want to modify a specific element in the array, let's say we want to do the assignment $a[i] = x$. 
-And we have to rebuild the Segment Tree, such that it correspond to the new, modified array. 
+And we have to rebuild the Segment Tree, such that it corresponds to the new, modified array. 
 
 This query is easier than the sum query. 
 Each level of a Segment Tree forms a partition of the array.