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

/**
 * 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>> res = new LinkedList<>();
        Queue<TreeNode> q = new LinkedList<>();
        if (root == null) return res;
        Boolean flag = true;
        q.offer(root);
        while(!q.isEmpty()) {
            LinkedList<Integer> temp = new LinkedList<>();
            int size = q.size();
            for (int i = 0; i < size; i++) {
                TreeNode node = q.poll();
                if (flag) {
                temp.add(node.val);
                } else {
                    temp.addFirst(node.val);
                }
                if (node.left != null)
                	q.offer(node.left);
                if (node.right != null)
                	q.offer(node.right);
            }
            res.add(temp);
            flag = !flag;
        }
        return res;
    }
}