Question d’entretien chez Meta
Iterative in-order traversal
Réponse à la question d'entretien
Utilisateur anonyme
28 juill. 2018
Use a stack in a while loop until is empty adding left nodes until there's a leaf then add the right ones.
Iterative in-order traversal
Utilisateur anonyme
Use a stack in a while loop until is empty adding left nodes until there's a leaf then add the right ones.