How to merge two trees with less time complexity.
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.
As per question, since there is no constraint on the nodes of the merged tree, I will make the root of second tree as child of first tree's leaf node. i.e. leafNode-> secondTree'sRoot.
- Anonymous June 17, 2010Recall that order of reaching tree's leaf node from the root is O(n/2).