【leetcode】【easy】107. Binary Tree Level Order Traversal II

最新推荐文章于 2022-06-05 23:54:20 发布

lemonade13

最新推荐文章于 2022-06-05 23:54:20 发布

阅读量72

点赞数

分类专栏： c++ code

本文链接：https://blog.csdn.net/lemonade13/article/details/104295226

版权

code 同时被 2 个专栏收录

233 篇文章 0 订阅

订阅专栏

c++

230 篇文章 0 订阅

订阅专栏

107. Binary Tree Level Order Traversal II

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]
]

题目链接：https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii/submissions/

思路

本题就是在正常层序遍历的基础上改了下存储顺序，只要会做层序遍历的题，本题就很简单。

下面几种实现也是在层序遍历的基础上稍做修改，具体分析见这篇文章。

法一：非递归，队列，记录层长度

把原本的push()改为insert()到头部即可。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> levelOrderBottom(TreeNode* root) {
        vector<vector<int>> res;
        if(root==NULL) return res;
        queue<TreeNode*> record;
        record.push(root);
        while(!record.empty()){
            int len = record.size();
            vector<int> restmp;
            for(int i=0; i<len; ++i){
                auto tmp = record.front();
                record.pop();
                restmp.push_back(tmp->val);
                if(tmp->left) record.push(tmp->left);
                if(tmp->right) record.push(tmp->right);
            }
            res.insert(res.begin(), restmp);
        }
        return res;
    }
};

法三：递归

存储的时候修改索引即可。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
private:
    vector<vector<int>> res;
    int nlevel;
public:
    vector<vector<int>> levelOrderBottom(TreeNode* root) {
        if(root==NULL) return res;
        nlevel = getLevel(root);
        res.resize(nlevel);
        order(root, 1);
        return res;
    }
    void order(TreeNode* root, int level){
        if(root!=NULL){
            (res[nlevel-level]).push_back(root->val);
            order(root->left, level+1);
            order(root->right, level+1);
        }
    }
    int getLevel(TreeNode* root){
        if(root==NULL) return 0;
        return max(getLevel(root->left), getLevel(root->right))+1;
    }
};