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.
This seems to be the best out of the solutions posted above. At each node, store the number of nodes in the left sub tree and the number of nodes in the right sub tree!
- rahil9800 November 18, 2012Also store the depth of the left tree and depth of the right tree.
An inorder traversal at any point will give the pages of the book in order. Now, while inserting the precise point of insertions is known. i.e while inserting pg 15 we have to reach the node which has a cumulative of 14 pages. Insert the node. Now use balancing techniques to rebalance the tree