Depth First Search

Depth first search is a graph traversal algorithm that starts at a root node and explores as far as possible along each branch before backtracking.

Visit the following resources to learn more:

• @article@Breadth-First Search (BFS) and Depth-First Search (DFS) for Binary Trees in Java
• @video@BFS and DFS in a Binary Tree
• @video@Depth First Search in 4 Minutes