LeetCode(103) Binary Tree Zigzag Level Order Traversal解题报告

最新推荐文章于 2021-02-05 11:10:39 发布

Ssunsets

最新推荐文章于 2021-02-05 11:10:39 发布

阅读量351

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/Ssunsets/article/details/50245205

版权

LeetCode 专栏收录该内容

32 篇文章 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]
]

解题思路:

层次遍历二叉树，用一个标记来确定该层需要从左到右还是从右到左。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    List<List<Integer>> res;
    boolean flag;
    public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
        flag = true;
        res = new ArrayList<List<Integer>>();
        List<TreeNode> node = new ArrayList<TreeNode>();
        if(root != null && node.add(root))
            levelValue(node);
        return res;
    }
    public void levelValue(List<TreeNode> node){
        TreeNode tn;
        TreeNode td;
        List<Integer> value = new ArrayList<Integer>();
        List<TreeNode> temp = new ArrayList<TreeNode>();
        if(node.size() == 0)
            return ;
        for(int i = 0; i < node.size(); i++){
            tn = node.get(i);
            value.add(tn.val);
            td = node.get(node.size()-1-i);
            if(flag){
                if(td.right != null && temp.add(td.right));
                if(td.left != null && temp.add(td.left));
            }
            else{
                if(td.left != null && temp.add(td.left));
                if(td.right != null && temp.add(td.right));
            }
        }
        flag = !flag;
        res.add(value);
        levelValue(temp);
    }
}