View All num of num See all Photos Microsoft www.microsoft.com Engaged Employer Overview Reviews Salaries Interviews Jobs Photos Benefits 9.6k Reviews 32k Salaries 4.1k Interviews Follow Add Interview Follow Add Interview Interview Question Software Development Engineer Intern Interview(Student Candidate) Redmond, WA Microsoft Print a binary tree level by level in zigzag order Tags: See more , See less 8 Answer Add Tags Answer Interview Answer 3 Answers ▲ 1 ▼ You should use two stacks: for the current level and for the next one. Alexey on 07-Jan-2013 ▲ 0 ▼ Use a queue.1.Push root on queue.2. Begin Loop Repeat while node is not equal to NULL: a. Pop b. Print value c. Push node's Right Child d. Push node's Left Child3. End Nofel on 27-Jan-2013 ▲ 1 ▼ The answer given by me above is wrong because I was not clear about the zig zag ordering I applied it wrong ! Nofel on 27-Jan-2013 Interviews > Software Development Engineer Intern > Microsoft Add Answers or Comments To comment on this, Sign In or Sign Up.