We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 4073590 commit a24b3abCopy full SHA for a24b3ab
tutorials/graph-theory/breadth-first-search.md
@@ -33,7 +33,7 @@ def findTargetNode(root, targetValue):
33
currentLevel = [root]
34
35
#we increase our depth one by one as long as there is still node
36
- while(len(level) > 0):
+ while(len(currentLevel) > 0):
37
38
#we store the current level node's children in nextLevel
39
nextLevel = []
0 commit comments