【leetcode】103. Binary Tree Zigzag Level Order Traversal

题目要求：

Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).

For example:
Given binary tree [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7

return its zigzag level order traversal as:

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

即给定一棵二叉树，返回zigzag层序遍历，也就是第一层从左向右遍历，第二层从右向左遍历，第三层从左向右遍历，以此类推...

思路：记录层序遍历的结果，然后把层序遍历结果的偶数层翻转

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
        List<List<Integer>> result =new LinkedList<List<Integer>>();
        if(root==null)
        {
            return result;
        }
        //层序遍历，每一层换方向
        Queue<TreeNode> queue = new LinkedList<TreeNode>();
      
        queue.add(root);
        TreeNode node;
        while(!queue.isEmpty())
        {
            List<Integer> list = new LinkedList<Integer>();
            int size = queue.size();
            for(int i =0;i<size;i++)
            {
                node =queue.poll();
                list.add(node.val);
                if(node.left!=null)
                {
                    queue.add(node.left);
                }
                if(node.right!=null)
                {
                    queue.add(node.right);
                }
            }
            result.add(list);
        }
        
        //对result的偶数层反转
        for(int i=0;i<result.size();i++)
        {
            if(i%2!=0)
            {
                Collections.reverse(result.get(i));
            }
        }
        return result;
    }
}