Interview Question

Interview(Student Candidate) Redmond, WA

Print a binary tree level by level in zigzag order

Answer

Interview Answer

3 Answers

1

You should use two stacks: for the current level and for the next one.

Alexey on Jan 7, 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 Child 3. End

Nofel on Jan 27, 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 Jan 27, 2013

Add Answers or Comments

To comment on this, Sign In or Sign Up.