is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.
CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.
Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.
Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.
I just have a rough idea, haven't implement it yet.
- Xi.LaGrange January 30, 2013findRemoteNode(int k)
define 3 kinds of recursive calls:
a. findRemoteNode( k - 1) in left_child
b. findRemoteNode( k - 1) in right_child
c. findRemoteNode( k - 1) in parent
if called by parent, only do a, b
if called by left_child, only do b, c
if called by right_child, only do a, c
if k == 0, return it self.
---------------------------------------------------
Oh...I think I am wrong, cuz the question didnot mention we have pointer to parent.