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

 

/**
 * 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>> res = new ArrayList();
        Deque<TreeNode> queue = new LinkedList<>();
        if(root != null){
            queue.offer(root);
        }
        boolean flag = true;
        while (!queue.isEmpty()){
            int size = queue.size();
            Deque<Integer> que = new LinkedList();
            for(int i = 0 ; i < size; i++){
                TreeNode temp = queue.poll();
                if(flag){
                    que.offerLast(temp.val);
                }else {
                    que.offerFirst(temp.val);
                }
                if(temp.left != null){
                    queue.add(temp.left);
                }
                if(temp.right != null){
                    queue.add(temp.right);
                }   
            }
            flag = !flag;
            res.add(new LinkedList<Integer>(que));
        }
        return res;
    }
}