From 740e57941868561e976df2139e569dfbaea53d41 Mon Sep 17 00:00:00 2001 From: Louie Tan Date: Sun, 30 Sep 2018 13:36:03 +0800 Subject: [PATCH] Fix reference to wrong traversal algorithm Fixes #105 --- algorithms/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/algorithms/README.md b/algorithms/README.md index bbcbab1d..d6a2e427 100644 --- a/algorithms/README.md +++ b/algorithms/README.md @@ -490,7 +490,7 @@ Recursion is a common approach for trees. When you notice that the subtree probl When using recursion, always remember to check for the base case, usually where the node is `null`. -When you are asked to traverse a tree by level, use depth first search. +When you are asked to traverse a tree by level, use breadth-first search. Sometimes it is possible that your recursive function needs to return two values.