Kalido Interview Question for Software Engineer / Developers

Country: India
Interview Type: In-Person

Comment hidden because of low score. Click to expand.
of 0 vote

The solution can be achieved if we traverse the tree like BFS
Enqueue root node first into a queue A(first level)
Dequeue the root node in queue A and enqueue it's children in queue B
Now dequeue all elements in queue B and enqueue their children in queue A
Increment a counter whenever you use a queue
do until you don't have any elements in the queue
The above process is like level order traversal and the incremented count gives the levels or height of the tree

- SecretAgent October 11, 2011 | Flag Reply
Comment hidden because of low score. Click to expand.
of 0 vote

<pre lang="" line="1" title="CodeMonkey84524" class="run-this">int height(struct tree* root)
return 0;

return (1+ max(height(root->lchild), height(root->rchild)));

</pre><pre title="CodeMonkey84524" input="yes">

- Anonymous October 13, 2011 | Flag Reply

Add a Comment

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.


is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More


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.

Learn More

Resume Review

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.

Learn More

Mock Interviews

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.

Learn More