let 103. Binary Tree Zigzag Level Order Traversal

主题思想： 我是用栈解决的，还有一种方法是利用递归。
利用栈的AC 代码：

/**
 * 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>> ans=new ArrayList<List<Integer>>();
        if(root==null) return ans;

        Deque<TreeNode> q=new ArrayDeque<TreeNode>();

        q.push(root);

        int level=0;
        while(!q.isEmpty()){

            int levelNum=q.size();
            List<Integer> tmp=new ArrayList<Integer>();
            TreeNode node=null;
            Deque<TreeNode> tmpStack=new ArrayDeque<TreeNode>();
            for(int i=0;i<levelNum;i++){
                node=q.pop();
                tmp.add(node.val);
                if(level%2==0){

                    if(node.left!=null) tmpStack.push(node.left);
                    if(node.right!=null) tmpStack.push(node.right);
                }else{
                    if(node.right!=null) tmpStack.push(node.right);
                    if(node.left!=null) tmpStack.push(node.left);
                }
            }
            level++;
            ans.add(tmp);
            q=tmpStack;
        }
        return ans;
    }
}

递归的解决方法：

public class Solution {
    public List<List<Integer>> zigzagLevelOrder(TreeNode root) 
    {
        List<List<Integer>> sol = new ArrayList<>();
        travel(root, sol, 0);
        return sol;
    }

    private void travel(TreeNode curr, List<List<Integer>> sol, int level)
    {
        if(curr == null) return;

        if(sol.size() <= level)
        {
            List<Integer> newLevel = new LinkedList<>();
            sol.add(newLevel);
        }

        List<Integer> collection  = sol.get(level);
        if(level % 2 == 0) collection.add(curr.val);
        else collection.add(0, curr.val);

        travel(curr.left, sol, level + 1);
        travel(curr.right, sol, level + 1);
    }
}