Question: What is a key characteristic of DFS compared to BFS?

Options:

1. DFS uses less memory than BFS.
2. DFS explores all neighbors before going deeper.
3. DFS can be implemented using recursion.
4. DFS guarantees the shortest path.

Correct Answer: DFS can be implemented using recursion.

Solution:

A key characteristic of DFS is that it can be implemented using recursion, allowing it to explore as far as possible along each branch before backtracking.