Flipkart Interview Question for Software Engineer / Developers






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

Isn't it just breadth first traversal? Am I missing something?

- Anonymous October 12, 2010 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

consider the tree is organized in an array as below;

a[0]
           /   \
         a[1]   a[2]
        /  \     /   \
      a[3] a[4] a[5] a[6]
     / \    /
   a[7]a[8]a[9]...........

then the elements in n'th level from top will be from a[(2^n)-1] ...to...a[(2(n+1)-2)]. For Example:
2nd level elements are from a[3] to a[6]

- chennavarri October 12, 2010 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

yes, its BFS. use queue and get it.

- Anonymous October 13, 2010 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

User a Q .. simple..

- Anonymous April 19, 2011 | Flag Reply


Add a Comment
Name:

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

Books

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

Videos

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