diff --git a/README.md b/README.md
index 23ffaa8f45a5de15a6c6a8bcbf95b1f1c4fd045b..982339cbed75c4be08395aa1b5ba169bb6f3dfa2 100644
--- a/README.md
+++ b/README.md
@@ -25,12 +25,6 @@ Instructor: [Romain Vuillemot](romain.vuillemot@ec-lyon.fr)
 
 📖 [Think Python](pdf/thinkpython2.pdf) chapter 11 (lists), chapter 12 (tuples), [Python for Everybody](pdf/pythonlearn.pdf) chapter 8 (lists) and Real Python [lists](https://realpython.com/python-list/) and [sorts](https://realpython.com/sorting-algorithms-python/).
 
---- 
-
-📝 Assignment 1 - Analyzing a simple dataset
-
----
-
 ### Lecture 4 - **Programming strategies: divide and conquer** | [notebook](04-) | [slides](03-lists-search-sort-slides.pdf) | [exercices](03-lists-search-sort-exercises.ipynb)
 
 📖 [Divide & conquer](https://en.wikibooks.org/wiki/Algorithms/Divide_and_Conquer)
@@ -43,33 +37,37 @@ Instructor: [Romain Vuillemot](romain.vuillemot@ec-lyon.fr)
 
 📖 [Dynamic programing](https://en.wikibooks.org/wiki/Algorithms/Dynamic_Programming)
 
-### Lecture 7 - **Trees**
+### Lecture 7 - **Stacks and queues**
 
 📖 [Problem Solving with Algorithms](pdf/problemsolving.pdf) chapter 6 (trees and tree algorithms)
 
----
+--- 
 
-📝Assignment 2 - Solving a problem with dynamic programming
+📝 Assignment 1 - Analyzing a simple dataset
 
 ---
 
+### Lecture 8 - **Trees**
+
+📖 [Problem Solving with Algorithms](pdf/problemsolving.pdf) chapter 6 (trees and tree algorithms)
+
+
 Next topics:
 
-1. **Stacks and queues**
 
-2. **Advanced data structures**
+1. **Advanced data structures**
 
-3. **Hashing**
+2. **Hashing**
 
-4. **Tree algorithms**
+3. **Tree algorithms**
 
-5. **Binary and n-trees**
+4. **Binary and n-trees**
 
-6. **Graphs**
+5. **Graphs**
 
-7. **Graphs algorithms**
+6. **Graphs algorithms**
 
-8. **Graphs shortest path algorithm**
+7. **Graphs shortest path algorithm**
 
 ## Books and ressources