Domanda di colloquio di Google
Describe an in-order binary search tree traversal.
Risposta di colloquio
Anonimo
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.
Anonimo
1. Push left side 2. Pop - visit 3. If popped node has right side push right node only, then back to 1.