Liao, your solution will generate the required manner. However, can you try to do the same by using some bool value and a single stack/ queue? Let bool value decide whether you want to insert right to left or left to right. Haven't tried myself but think that should work.
Karthik, never did i mention it's a complete binary tree. Maybe, in your interview, interviewer mentioned it's a complete binary tree. On Aug 28, 7:00 pm, "KARTHIKEYAN V.B." <algo...@gmail.com> wrote: > use one queue > > Enqueue all the nodes in normal level order traversal in the queue > > as 1 2 3 4 5 6 7 > > Each level contains 2 to the power n nodes in the queue. > > have two pointers ptr1 and ptr2 > > point ptr1 to the start node of 2 power n nodes range and ptr2 to the last > node of this range. > > For odd levels print nodes from ptr1 to ptr2 > > For even levels print nodes from ptr2 to ptr1 > > Keep count for odd and even levels so that it may be easy > > This was my question in Microsoft Interview for Internship in the 2nd round. > > But I too gave the solution using two stacks but the interviewer told me > this approach. > > Regards, > Karthik. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
