loading...
Play Button Pause Button
The DEV Team

BaseCS: Depth First Search Implementing

vaidehijoshi profile image Vaidehi Joshi ・1 min read

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:

vaidehijoshi profile

Vaidehi Joshi

@vaidehijoshi

Writing words, writing code. Sometimes doing both at once. Señiorita engineer at Forem.

The DEV Team

The team behind this very platform. 😄

Discussion

pic
Editor guide
 
 

thanks for such an amazing tutorial! I can feel the vibe strongly from what you are trying to give us. : ) cheers.