Meta interview question
Iterative in-order traversal
Interview Answer
Anonymous
28 Jul 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
Anonymous
Use a stack in a while loop until is empty adding left nodes until there's a leaf then add the right ones.
Check out your Company Bowl for anonymous work chats.