title: Performing Breadth First Search recursively
body: <p>Let's say you wanted to implement a breadth-first search of a binary tree <em>recursively</em>. How would you go about it?</p>
  
  <p>Is it possible using only the call-stack as auxiliary storage?</p>