Problem Solving Strategies::: DFS(Depth First Search)
In the process of problem solving, it makes sense to track backward if the process faces a dead-end. DFS requires less memory since only the nodes on the current path are stored. This contrasts with BFS, where all of the tree that has so far been generated must be stored. It is significant for the situation in which many acceptable solutions exist to employ DFS rather than BFS.
Architectures