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.
I wrote a helper class just to handle the BinaryTree stuff. It's at the end. Also, I believe tail-recursion is not recommended if possible, because it can be quite costly in resources (memory). You might be able to make the case its more readable, but generally recursion is more confusing and so prone to developers making mistakes anyway. I solved it using iteration, which should be more resource efficient.
RESULT
***BEFORE***
1 -left-> 2 || -right-> 3
2 -left-> 4 || -right-> 5
4 -left-> 6 || -right-> 7
6
7
5
3
***AFTER***
1 -left-> 2
2 -left-> 4 || -right-> 3
4 -left-> 6 || -right-> 5
6 || -right-> 7
7
5
3
TransformBinaryTree.java
BinaryTree.java
- matt.vagnoni October 29, 2014