Question

In a ______ search, we begin search at a starting node, and when we come across a dead end we backtrack.

• A. Breadth first
• B. Depth first
• C. Circular list
• D. Doubly list

Hint:

DFS uses stack (explicit or recursion), BFS uses queue.

Answer 1

The Correct Option is B

Concept: Depth First Search (DFS) explores as far as possible along a branch before backtracking.

Step 1: Understand given condition.
• Start at root
• Explore deep
• Backtrack on dead end

Step 2: Compare with algorithms.
• BFS → level-wise traversal
• DFS → depth-wise traversal with backtracking ✔

Step 3: Conclusion. \[ \boxed{(2)\ \text{Depth First Search}} \]