diff --git a/Algo/Courses/Chapter 6 - Lists.md b/Algo/Courses/Chapter 6 - Lists.md
index ccf72cb..0df7ffa 100644
--- a/Algo/Courses/Chapter 6 - Lists.md	
+++ b/Algo/Courses/Chapter 6 - Lists.md	
@@ -87,7 +87,7 @@ _: int list = [1 ; 2 ; 3; 4]
 
 ## List manipulation
 ### Traverse
-Sequential traverse have to solution, first is the list is empty, then you stop. Else if the list is not empty, we extract the head and the tail, we treat the head and we traverse the trail (rec call)
+Sequential traverse have two solution, first is the list is empty, then you stop. Else if the list is not empty, we extract the head and the tail, we treat the head and we traverse the trail (rec call)
 ```Ocaml
 # let p = (1, 2);;
 val p: int*int = (1,2)