Pregunta de entrevista de Meta
Iterative in-order traversal
Respuesta de la entrevista
Anónimo
28 de jul de 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
Anónimo
Use a stack in a while loop until is empty adding left nodes until there's a leaf then add the right ones.