Interview Question

Financial Software POsition Interview(Student Candidate) Los Angeles, CA

Print level 'l' of binary search tree.

Answer

Interview Answer

1 Answer

0

Use two nodes to keep track of parent and print left and right of parent once the level is reached

Interview Candidate on Oct 17, 2010

Add Answers or Comments

To comment on this, Sign In or Sign Up.