【LeetCode】C# 103、Binary Tree Zigzag Level Order Traversal

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

RUN_D

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

阅读量302

点赞数

分类专栏： leetcode 文章标签： leetcode c#

本文链接：https://blog.csdn.net/qq_39643935/article/details/78270917

版权

leetcode 专栏收录该内容

86 篇文章 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,null,null,15,7],

return its zigzag level order traversal as:
[
[3],
[20,9],
[15,7]
]
题意：Z字型遍历完二叉树。
思路：跟上一题一样，不过根据level奇偶数。
区别：运用这个来判断从前往后加还是由后往前。

if(level%2==0)
    res[level].Add(tree.val);
else res[level].Insert(0,tree.val);

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left;
 *     public TreeNode right;
 *     public TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<List<int>> ZigzagLevelOrder(TreeNode root) {
        List<List<int>> res = new List<List<int>>();
        zigzag(res,root,0);
        return res;
    }
    public static void zigzag(List<List<int>> res, TreeNode tree,int level){
        if(tree == null) return;
        if(level>res.Count-1) res.Add(new List<int>());
        if(level%2==0)
            res[level].Add(tree.val);
        else res[level].Insert(0,tree.val);
        zigzag(res,tree.left,level+1);
        zigzag(res,tree.right,level+1);
    }
}