13.Depth-First Search (DFS)

Definition DFS explores as far down a branch as possible before backtracking.It follows one path deeply until it can’t go further, then goes back and explores other paths. Algorithm (Simple Steps) Pu