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
https://howcode.org/t/using-a-stack-t...
Go to https://howcode.org for more!
Link to DigitalOcean: http://howco.de/d_ocean
Link to howCode Facebook: http://howco.de/fb
Link to howCode Twitter: http://howco.de/twitter
Link to /r/howCode: http://howco.de/reddit
Don't forget to subscribe for more!