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.
Each node in given tree (BST) has two pointers 1) parent node say p 2) random any other node say r.
- jitter January 01, 2013So this forms another logical tree (with left and right pointers as p, r) where root is the current given node from which we want to find the path. Now we can traverse this new logical tree to find the target node with given value.
Obviously this assumes that newly formed structure with r and p pointers is forming a tree (ie, acyclic).