Explain Depth-First Search (DFS). What data structure does it use?

Difficulty: 3/10

graph traversal, stack vs recursion, cycle detection

Depth-First Search

DFS explores as far as possible along one path before backtracking. It can be implemented recursively using the call stack or iteratively using an explicit stack. DFS is fundamental for cycle detection, topological sorting, connected components, and strongly connected component algorithms.

javascript

1
Primary data structure: Stack or recursion stack.
2
Explores deeply before backtracking.
3
Useful for connectivity and cycle detection.
4
Iterative DFS uses an explicit stack.

Scenario Questions

0-2 years experience

2-5 years experience

Follow-up Questions