Algorithms, Data Structures, DFS, Bfs, Graphs.
implemented by recursion or a stack data structure (versus queue in BFS) to keep track of the nodes. Generally, it uses less memory to store nodes in the current path. One downside I have to mention here — it might not find the shortest path, it returns the first found path which is not guaranteed