BaseCS: Depth First Search Implementing

Today's episode of BaseCS explores the logic behind implementing the depth-first algorithm!

We'll start by learning about recursion, the strategy for implementing DFS, and investigate the time complexity of the algorithm. We'll also see how to implement a single node in code and try our hand at implementing a preOrderSearch function! Finally, we'll look at the space complexity of DFS, and investigate how running this algorithm impacts the call stack.

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.