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

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

难度中等

请实现一个函数按照之字形顺序打印二叉树，即第一行按照从左到右的顺序打印，第二层按照从右到左的顺序打印，第三行再按照从左到右的顺序打印，其他行以此类推。

例如:

给定二叉树: [3,9,20,null,null,15,7],

3

/ \

9 20

/ \

15 7

返回其层次遍历结果：

[

[3],

[20,9],

[15,7]

]

提示：

1. 节点总数 <= 1000

/**

* 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<>();

            }

            List<List<Integer>> result = new ArrayList<>();

            LinkedList<TreeNode> linkedList = new LinkedList<>();

            linkedList.add(root);

            boolean first = true;

            while (!linkedList.isEmpty()) {

                List<Integer> list = new ArrayList<>();

                for (int i = linkedList.size(); i > 0; i--) {

                    TreeNode temp = linkedList.pop();

                    if (first) {

                        list.add(temp.val);

                    }else{

                        list.add(0,temp.val);

                    }

                    if (temp.left != null) {

                        linkedList.add(temp.left);

                    }

                    if (temp.right != null) {

                        linkedList.add(temp.right);

                    }

                }

                first = !first;

                result.add(list);

            }

            return result;

    }

}