breadth first traversal of a binary tree
Anónimo
had completely forgotten how to do it. so came up with a recursive routine to reach all nodes at a given depth and print them. granted it was anything but run of the mill and unoptimized. it really puzzled the interviewer and took some time to explain the solution and subsequent dry runs to prove correctness. I though it was fun but at the end of it I was asked to try and use queues to do it.