Pergunta de entrevista da empresa Meta
Traverse a binary tree one level at a time.
Resposta da entrevista
Sigiloso
27 de set. de 2012
For breadth first, add all children to the queue, then pull the head and do a breadth first search on it, using the same queue