Want a Free Job Posting?

Buy a job posting today and the second one is on us. For a limited time only. Act Now.

Interview Question

Interview(Student Candidate)

The best implementation for a binary tree.


Interview Answer

1 Answer


In-order search. Because you just need to locate the root value, and then the left side of the root value is the left tree, and the right side of the root value is the right tree.

nova on Aug 6, 2013

Add Answers or Comments

To comment on this, Sign In or Sign Up.