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

题目链接：

思路分析

交叉式遍历一棵二叉树。

Using a list to store traversal result. Using a zigzagHelper which stores the level traveled. Recursively traversal. For null node return null. For newlevel, new a new list and add it in result. After that, store node value according to node’s level. then recursively travel from node’s left children to right children.

代码

/**
 * 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>> zigzagLevelOrder(TreeNode root) {
        List<List<Integer>> res = new ArrayList<>();
        zigzagHelper(root, res, 0);
        return res;
    }
    
    private void zigzagHelper(TreeNode node, List<List<Integer>> res, int level){
        if (node == null){
            return;
        }
        if (res.size() <= level){
            List<Integer> newLevel = new ArrayList<>();
            res.add(newLevel);
        }
        List<Integer> thisLevel = res.get(level);
        if (level % 2 == 0){
            thisLevel.add(node.val);
        }
        else{
            thisLevel.add(0, node.val);
        }
        zigzagHelper(node.left, res, level + 1);
        zigzagHelper(node.right, res, level + 1);
    }
}

时间复杂度：O(n)
空间复杂度：O(n)

---

反思

The point is find right way to inverse travel order.