> then, when discussing how to turn recursive functions into iterators using an explicit stack (which permits breadth-first searching); How about a depth-first

> then, when discussing how to turn recursive functions into iterators using an explicit stack (which permits breadth-first searching); How about a depth-first search?