【leetcode 103】Binary Tree Zigzag Level Order Traversal 二叉树之字形层序遍历

题目

Share

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]
]

解题思路

本题的解题思路可以借用【leetcode 102】题的解题思路，只是在最终进行结果返回之前，对奇数行的数组进行翻转，这一步我们可以使用Collections工具类中的reverse方法处理

代码实现

    public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
        List<List<Integer>> res = new ArrayList<List<Integer>>();
        levelHelper(res, root, 0);
        for (int i = 0; i < res.size(); i++) {
            if (i % 2 != 0) {
                List<Integer> list = res.get(i);
                Collections.reverse(list);
            }
        }
        return res;
    }

    public void levelHelper(List<List<Integer>> res, TreeNode root, int height) {
        if (root == null) return;
        if (height >= res.size()) {
            res.add(new LinkedList<Integer>());
        }
        res.get(height).add(root.val);
        levelHelper(res, root.left, height + 1);
        levelHelper(res, root.right, height + 1);
    }