CS_learn/tech-interview-handbook
1
0
Fork 0
mirror of https://github.com/yangshun/tech-interview-handbook.git synced 2026-02-03 02:24:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix reference to wrong traversal algorithm

Browse Source 
Fixes #105
This commit is contained in:
Louie Tan
2018-09-30 13:36:03 +08:00
parent 01bcbfc49f
commit 740e579418
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
algorithms/README.md
View File

@@ -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.