LeetCode107. Binary Tree Level Order Traversal II（C++）

最新推荐文章于 2021-02-03 11:47:46 发布

Brielleqqqqqqjie

最新推荐文章于 2021-02-03 11:47:46 发布

阅读量195

点赞数 1

分类专栏： Leetcode

本文链接：https://blog.csdn.net/qq_41562704/article/details/87605990

版权

Leetcode 专栏收录该内容

110 篇文章 2 订阅

订阅专栏

Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).

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

return its bottom-up level order traversal as:

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

解题思路：层次遍历，用DFS更简洁，理论上层次遍历用BFS更适合。

class Solution {
public:
    vector<vector<int>>result;
    int maxlevel=0;
    vector<vector<int>> levelOrderBottom(TreeNode* root){
        if(root==NULL)
            result.resize(0);
        else{
            result.resize(1005);
            dfs(root,0);
            result.resize(maxlevel+1);
        }  
        reverse(result.begin(),result.end());
        return result;
    }
    void dfs(TreeNode *root, int level){
        result[level].push_back(root->val);
        maxlevel=max(maxlevel,level);
        if(root->left!=NULL)
            dfs(root->left,level+1);
        if(root->right!=NULL)
            dfs(root->right,level+1);
    }
};