【剑指 Offer 32 - III. 从上到下打印二叉树 III】

 【解题思路】

       这道题和上一道题【剑指 Offer 31 - II. 从上到下打印二叉树 II】类似，与之不同的是，这道题需要将偶数行的数据逆置。所以在偶数行对list进行逆置即可。

/**
 * 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>> levelOrder(TreeNode root) {
        if(root == null) return new ArrayList();

        ArrayList<TreeNode> level = new ArrayList<TreeNode>();
        ArrayList<ArrayList<TreeNode>> lists = new ArrayList<ArrayList<TreeNode>>();

        level.add(root);
        while(!level.isEmpty())
        {
            lists.add(level);
            ArrayList<TreeNode> newLevel = new ArrayList<TreeNode>();
            for(TreeNode node : level)
            {
                if(node.left != null)
                {
                    newLevel.add(node.left);
                }
                if(node.right != null)
                {
                    newLevel.add(node.right);
                }
            }
            level = newLevel;
        }

        List intLevel = new ArrayList();
        List intList = new ArrayList();
        int num = 1;
        for(ArrayList<TreeNode> list : lists)
        {
            intLevel = new ArrayList();
            for(TreeNode node : list)
            {
                intLevel.add(node.val);
            }
            if(num % 2 == 0)
            {
                Collections.reverse(intLevel);
            }
            intList.add(intLevel);
            num++;
        }

        return intList;
    }
}