Google

  www.google.com
  www.google.com

Interview Question

Software Development Engineer Interview Seattle, WA

Describe an in-order binary search tree traversal.

Answer

Interview Answer

1 Answer

0

1. Push left side
2. Pop - visit
3. If popped node has right side push right node only, then back to 1.

Luc on Feb 4, 2012

Add Answers or Comments

To comment on this Question, Sign In with Facebook or Sign Up