diff --git a/curriculum/challenges/english/blocks/lecture-understanding-graphs-and-trees/68baa5e4f0e07f079245ca08.md b/curriculum/challenges/english/blocks/lecture-understanding-graphs-and-trees/68baa5e4f0e07f079245ca08.md
index 1b8fb96fd07..c45a173edcd 100644
--- a/curriculum/challenges/english/blocks/lecture-understanding-graphs-and-trees/68baa5e4f0e07f079245ca08.md
+++ b/curriculum/challenges/english/blocks/lecture-understanding-graphs-and-trees/68baa5e4f0e07f079245ca08.md
@@ -150,7 +150,7 @@ Depth-first search (DFS) is commonly used to solve puzzles with a single solutio
 
 This algorithm can be implemented using recursion or a stack data structure to keep track of the visited nodes.
 
-Stacks follow the LIFO (last in, first out) method, where the last node that was added to the stack is the first one to the removed from the stack.
+Stacks follow the LIFO (last in, first out) method, where the last node that was added to the stack is the first one to be removed from the stack.
 
 The algorithm works like this: