Pergunta de entrevista da empresa Google
Describe an in-order binary search tree traversal.
Resposta da entrevista
Sigiloso
5 de fev. de 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.
Sigiloso
1. Push left side 2. Pop - visit 3. If popped node has right side push right node only, then back to 1.