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.
Actually this problem can be solved.Some of you guys said that when only preorder is given then it is not possible....but it is possible...whatever the nodes are given...then sort it first according to the ascending order....then this outcome is inorder traversal...and now you have inorder and preorder traversal ...and u can easily construct the binary search tree....
- souro August 03, 2012But one thing i am clearly saying that if the given order is not possible to sort...then you never got the inorder and only this time it is not possible to construct a BST...!! I think it is usefull for u guys..anyway if i am wrong then pls reply me...i will check it and i can getover from my wrong idea......!!