LeetCode-binary-tree-zigzag-level-order-traversal

最新推荐文章于 2019-08-20 23:28:59 发布

六月二十七

最新推荐文章于 2019-08-20 23:28:59 发布

阅读量120

点赞数

分类专栏： LeetCode 文章标签： binary-tree-zigzag-level-order LeetCode

本文链接：https://blog.csdn.net/weixin_42146769/article/details/89006676

版权

LeetCode 专栏收录该内容

105 篇文章 0 订阅

订阅专栏

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,#,#,15,7},

return its zigzag level order traversal as:

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

confused what"{1,#,2,3}"means? > read more on how binary tree is serialized on OJ.
OJ's Binary Tree Serialization:

The serialization of a binary tree follows a level order traversal, where '#' signifies a path terminator where no node exists below.

Here's an example:

The above binary tree is serialized as"{1,2,3,#,#,4,#,#,5}".

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
import java.util.ArrayList;
import java.util.Collections;
import java.util.LinkedList;
import java.util.Queue;
public class Solution {
    public ArrayList<ArrayList<Integer>> zigzagLevelOrder(TreeNode root) {
        ArrayList<ArrayList<Integer>> res = new ArrayList<>();
        if (root == null) {
            return res;
        }
        Queue<TreeNode> queue = new LinkedList<>();
        queue.add(root);
        TreeNode lastNode = root, levelLastNode = root;
        ArrayList<Integer> tmp = new ArrayList<>();
        int count = 0;
        while (queue.size() != 0) {
            TreeNode node = queue.poll();
            tmp.add(node.val);
            if (node.left != null) {
                queue.add(node.left);
                lastNode = node.left;
            }
            if (node.right != null) {
                queue.add(node.right);
                lastNode = node.right;
            }
            if (node == levelLastNode) {
                levelLastNode = lastNode;
                if (count % 2 != 0) {
                    Collections.reverse(tmp);
                }
                res.add(new ArrayList<>(tmp));
                tmp.clear();
                count++;
            }
        }
        return res;
    }
}