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 assume this is a full binary tree. Otherwise, we will need a way to represent null nodes in a level, e.g. 'space' character.
- ravi June 01, 2013With this assumption, the following logic should work.
* allocate an array with the size=total_nodes+1.
* Read each line from right to left
* Fill the array with each character from the end of the array (i.e. right to left).
* At the end of this, you should have the original binary tree represented as array.
* Now we should be able to do a pre-order traversal.
* Start the array traversal at index 1 ( this is the root element).
* Recursively do the following.
* Visit the node ( node at index).
* Visit left( node at 2*index).
* Visit right( node at 2*index+1).
This is the simplest what I can think of.
There might be other ways if we treat each line as level order traversal queue. But it will be complex.