Algorithms, Data Structures, DFS, Bfs, Graphs.
you go in depth. So since we have similar complexity (big O) for both I have chosen DFS. [Big O is O(V+E) for both algorithms, where V — vertices, E — edges. And as I mentioned earlier, BFS take extra space for storing queue, at the same time DFS also consumes some memory running itself recursively