103. 二叉树的锯齿形层次遍历

给定一个二叉树，返回其节点值的锯齿形层次遍历。（即先从左往右，再从右往左进行下一层遍历，以此类推，层与层之间交替进行）。

例如：
给定二叉树 [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7
返回锯齿形层次遍历如下：

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

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
        List<List<Integer>> result = new ArrayList();
        if(root == null){
            return result;
        }
        Stack<TreeNode> stack = new Stack<>();
        stack.push(root);
        TreeNode curr = root;
        int i = 1;
        while(!stack.isEmpty()){
            List<Integer> tempList = new ArrayList();
            Stack<TreeNode> tempStack = new Stack<>();
            while(!stack.isEmpty()){
                curr = stack.pop();
                tempList.add(curr.val);
                if(i % 2 == 1){
                    if(curr.left != null){
                        tempStack.push(curr.left);
                    }
                    if(curr.right != null){
                        tempStack.push(curr.right);
                    }
                }else{
                    if(curr.right != null){
                        tempStack.push(curr.right);
                    }
                    if(curr.left != null){
                        tempStack.push(curr.left);
                    }
                }
            }
            result.add(tempList);
            stack = tempStack;
            ++i;
        }
        return result;
    }
}