Question:medium

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

Show Hint

DFS uses stack (explicit or recursion), BFS uses queue.
Updated On: Jun 5, 2026
  • Breadth first
  • Depth first
  • Circular list
  • Doubly list
Show Solution

The Correct Option is B

Solution and Explanation

Was this answer helpful?
0


Questions Asked in CUET (PG) exam