# I didn't write it, but this is an iterative breadth-first tree traversal
# (i.e: you generate the words, enqueue them on a queue, dequeue from the queue
# until it's empty or you found the second word).