title: Difference between Breadth First Search, and Iterative deepening
body: <p>I understand BFS, and DFS, but for the life of me cannot figure out the difference between iterative deepening and BFS. Apparently Iterative deepening has the same memory usage as DFS, but I am unable to see how this is possible, as it just keeps expanding like BFS.
  If anyone can clarify that would be awesome.</p>
  
  <p>tree to work on if required:</p>
  
  <pre><code>    A
     / \
    B   C
   /   / \
  D   E   F
  </code></pre>