【LeetCode】C# 102、Binary Tree Level Order Traversal

最新推荐文章于 2020-07-24 09:24:00 发布

RUN_D

最新推荐文章于 2020-07-24 09:24:00 发布

阅读量451

点赞数

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

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

版权

leetcode 专栏收录该内容

86 篇文章 0 订阅

订阅专栏

Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).

For example:
Given binary tree [3,9,20,null,null,15,7],

return its level order traversal as:

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

二叉树层序遍历。
思路：建立List<List<int>>来存放结果，迭代时用level参量来标记层数即可。然后中序遍历。

/**
 * 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>> LevelOrder(TreeNode root) {
        List<List<int>> res = new List<List<int>>();
        LO(res,root,0);
        return res;
    }
    public static void LO(List<List<int>> res,TreeNode tree,int level){
        if(tree == null) return;
        if(level >= res.Count) res.Add(new List<int>());
        res[level].Add(tree.val);
        LO(res,tree.left,level+1);
        LO(res,tree.right,level+1);
    }
}