LEETCODE--Binary Tree Level Order Traversal II

最新推荐文章于 2019-08-20 23:29:01 发布

prettysky123

最新推荐文章于 2019-08-20 23:29:01 发布

阅读量259

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/prettysky123/article/details/49736145

版权

leetcode 专栏收录该内容

137 篇文章 0 订阅

订阅专栏

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,#,#,15,7},

return its bottom-up level order traversal as:

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

/**
 * 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>> finsh;
    void levelsort(TreeNode* root, int level){
        if(!root)
          return ;
        if(level == finsh.size())
         {
            vector<int> add;
            finsh.push_back(add);
         }
        finsh[level].push_back(root->val);
        levelsort(root->left, level+1);
        levelsort(root->right, level+1);
    }
    vector<vector<int>> levelOrderBottom(TreeNode* root) {
        levelsort(root, 0);
        return vector<vector<int> >(finsh.rbegin(), finsh.rend());
    }
};