Google interview question
Describe an in-order binary search tree traversal.
Interview Answer
Anonymous
5 Feb 2012
1. Push left side 2. Pop - visit 3. If popped node has right side push right node only, then back to 1.
Describe an in-order binary search tree traversal.
Anonymous
1. Push left side 2. Pop - visit 3. If popped node has right side push right node only, then back to 1.
Check out your Company Bowl for anonymous work chats.