In an algorithms course I'm taking, it's said that depth-first search (DFS) is far more space efficient than breadth-first search (BFS).
Why is that?
Although they are basically doing the same thing, in DFS we're stacking the current node's successors while in BFS we're enqueueing the successors.