Domanda di colloquio di Meta
Iterative in-order traversal
Risposta di colloquio
Anonimo
28 lug 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
Anonimo
Use a stack in a while loop until is empty adding left nodes until there's a leaf then add the right ones.