Pregunta de entrevista de Meta
Traverse a binary tree one level at a time.
Respuesta de la entrevista
Anónimo
27 de sept 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