Today's episode of BaseCS explores depth-first tree traversal on trees!

We'll learn the basics of the DFS algorithm, and see how to interact with a single node when traversing through a tree. Next, we'll investigate the different common strategies used to implement this algorithm: Preorder, Inorder, and Postorder search. Finally, we'll learn about the benefits and downsides of these different strategies and determine when to use one strategy over the other!

This whole series is sponsored by Heroku. A special thank you to Heroku for their ongoing support!

Heroku Follow

Heroku is a container-based cloud Platform as a Service (PaaS). Developers use Heroku to deploy, manage, and scale modern apps. Our platform is elegant, flexible, and easy to use, offering developers the simplest path to getting their apps to market.