Cookies help us deliver our services. By using our services, you agree to our use of cookies. Click here to learn more

Interview Question

Senior Programmer Interview Southam, West Midlands, England (UK)

The common ancestor problem. Given an unbalanced binary

  tree and 2 nodes on that tree what is fastest way to find the common ancestor?

Interview Answer

1 Answer


You need think about various issues; possibly pre-processing, speed vs space and related to this what happens if the tree becomes enormous.

Interview Candidate on 18 Oct 2012

Add Answers or Comments

To comment on this, Sign In or Sign Up.