Question d’entretien chez Meta
Traverse a binary tree one level at a time.
Réponse à la question d'entretien
Utilisateur anonyme
27 sept. 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