Leetcode Binary Tree Zigzag Level Order Traversal

题目：

Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).

For example:
Given binary tree {3,9,20,#,#,15,7},

    3
   / \
  9  20
    /  \
   15   7

return its zigzag level order traversal as:

[
  [3],
  [20,9],
  [15,7]
]

分析：

用两个栈实现，一个栈pre用来记录上一层节点的情况，一个栈cur用来记录本层节点的情况。但是需要注意，奇数层和偶数层的入栈方式不一样，奇数层的节点弹栈之后先把左节点压入，偶数层的节点弹栈之后先把右节点压入。设置一个标志位来判断一下即可。

Java代码实现：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
        List<List<Integer>> result = new ArrayList<List<Integer>>();
        if(root==null)
            return result;
            
        Stack<TreeNode> pre = new Stack<TreeNode>();
        pre.push(root);
        boolean flag = true;
        
        while(!pre.isEmpty())
        {
            ArrayList<Integer> temp = new ArrayList<Integer>();
            Stack<TreeNode> cur = new Stack<TreeNode>();
            while(!pre.isEmpty())
            {
                TreeNode node = pre.pop();
                temp.add(node.val);
                if(flag)
                {
                    if(node.left!=null)
                        cur.push(node.left);
                    if(node.right!=null)
                        cur.push(node.right);
                }
                else
                {
                    if(node.right!=null)
                        cur.push(node.right);
                    if(node.left!=null)
                        cur.push(node.left);
                }
            }
            result.add(temp);
            pre = cur;
            flag = !flag;
        }
        return result;
    }
}