Question d’entretien chez Google
Write code for depth first search in a binary tree (iterative or recursive) and explain what's the performance.
Réponse à la question d'entretien
Utilisateur anonyme
9 mars 2011
Don't forge to use a stack!
1
Write code for depth first search in a binary tree (iterative or recursive) and explain what's the performance.
Utilisateur anonyme
Don't forge to use a stack!