diff --git a/lectures/20_trees_III/README.md b/lectures/20_trees_III/README.md
index d0e7125..dddf9c5 100644
--- a/lectures/20_trees_III/README.md
+++ b/lectures/20_trees_III/README.md
@@ -253,6 +253,7 @@ void shortest_path_breadth(Node* root)
        next_level.clear();
       }
      }
+```
 
 - What is the running time of this algorithm? Can we do better? Hint: How does a breadth-first vs. depth-first algorithm for this problem compare?