In Depth-First Search (DFS), which data structure is primarily used?

In Depth-First Search (DFS), which data structure is primarily used?

Step 1: Understand that Depth-First Search (DFS) is a method for exploring nodes in a graph or tree.
Step 2: Recognize that DFS needs a way to remember which nodes to visit next.
Step 3: Learn that a stack is a data structure that works like a stack of plates, where you can only add or remove the top plate.
Step 4: Realize that in DFS, we use a stack to keep track of the nodes we need to explore.
Step 5: Note that this stack can be implemented explicitly (by creating a stack data structure) or implicitly (using the call stack in recursion).

No concepts available.