Binary Tree Level Order Traversal II【二叉树层序转换】

最新推荐文章于 2023-03-20 11:15:24 发布

Sim0Hayha

最新推荐文章于 2023-03-20 11:15:24 发布

阅读量190

点赞数

分类专栏：数据结构与算法

本文链接：https://blog.csdn.net/Sim0Hayha/article/details/79459530

版权

数据结构与算法专栏收录该内容

42 篇文章 0 订阅

订阅专栏

PROBLEM:

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

SOLVE:

/**
 * 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>> T;
        int level=0;
        levelOrder(root,T,level);
        std::reverse(T.begin(),T.end());
        return T;
    }
    void levelOrder(TreeNode* root,vector<vector<int>> &T,int curlevel){
        if(root==NULL) return;
        if(T.empty()||T.size()<curlevel+1)
            T.push_back(vector<int>());
        T[curlevel].push_back(root->val);
        levelOrder(root->left,T,curlevel+1);
        levelOrder(root->right,T,curlevel+1);
    }
};

注意：1、用引用传递容器；2、二维容器中压入一个空的一维容器：T.push_back(vector<int>())