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!
Posted on by: