Java二叉树的锯齿形层序遍历leetcode

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

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
        List<List<Integer>> list1 = new ArrayList<List<Integer>>();
        if(root == null){
            return list1;
        }
        Queue<TreeNode> queue = new LinkedList<TreeNode>();
        queue.add(root);

        TreeNode temp = new TreeNode();
        //给一个标志
        boolean flag = true;
        while(!queue.isEmpty()){
            
            List<Integer> list2 = new ArrayList<Integer>();
            int size = queue.size();

            for(int i = 0;i< size;i++){
                temp = queue.poll();

                list2.add(temp.val);
                if(temp.left != null){
                    queue.add(temp.left);
                }
                if(temp.right != null){
                    queue.add(temp.right);
                }
            }
            if(!flag){
                Collections.reverse(list2);
            }
            flag = !flag;
            list1.add(list2);

        }
        return list1;

    }
}