title: Why is depth-first search claimed to be space efficient?
body: <p>In an algorithms course I'm taking, it's said that <em>depth-first search</em> (DFS) is far more space efficient than <em>breadth-first search</em> (BFS).</p>
  
  <p>Why is that? </p>
  
  <p>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.</p>