In this video we'll be learning about trees, traversal, depth-first search (DFS) and how we can implement DFS easily using both recursion and iteration.
Bonus! Using a stack and Python to find unbalanced parenthesis
[ Ссылка ]
Go to [ Ссылка ] for more!
Link to DigitalOcean: [ Ссылка ]
Link to howCode Facebook: [ Ссылка ]
Link to howCode Twitter: [ Ссылка ]
Link to /r/howCode: [ Ссылка ]
Don't forget to subscribe for more!
