Section 3.3 Implementing Graph Traversal Using Queues and Stacks

Breadth-First Search and Depth-First search often produce quite different trees, but their mechanics are very similar and in fact their essential difference is one's using a queue versus the other's using a stack.