adding the closing quotes

2024-03-18 00:46:35 -04:00
parent dc561a1eb0
commit 991f9a34ac
1 changed files with 1 additions and 0 deletions
--- 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;