From 991f9a34ace3e4bb59472b78e703983b95fa1cf2 Mon Sep 17 00:00:00 2001
From: Jidong Xiao <xiaoj8@rpi.edu>
Date: Mon, 18 Mar 2024 00:46:35 -0400
Subject: [PATCH] adding the closing quotes

---
 lectures/20_trees_III/README.md | 1 +
 1 file changed, 1 insertion(+)

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?
 &nbsp;