Question d’entretien chez Palantir Technologies
Print a binary tree using breadth first search, i.e. print all numbers level by level on a tree. Add a line break between each level.
Réponse à la question d'entretien
Utilisateur anonyme
4 avr. 2014
You need two counters to keep track of where you are and you need to use a queue to perform BFS
1