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.
Most of the answers are wrong. As @msft pointed out the solutions will return the following BST is valid
- raam December 03, 20135 <- 10 ->15
Left child of 5 is 20. This is not a BST but the solutions would validate this case..
The simplest solution is to perform inorder traversal and check if every node is greater than the previous node. If the inorder traversal is sorted then it is a BST.