给定一个二叉树,返回其节点值自底向上的层次遍历。 (即按从叶子节点所在层到根节点所在的层,逐层从左向右遍历)
例如:
给定二叉树 [3,9,20,null,null,15,7]
,
3 / \ 9 20 / \ 15 7
返回其自底向上的层次遍历为:
[ [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>> levelOrderBottom(TreeNode* root) {
vector<vector<int>> vec;
if(root==NULL){
return vec;
}
queue<TreeNode *> que;
que.push(root);
while(!que.empty()){
int size = que.size();
vector<int> tmp;
while(size--){
TreeNode *a;
a = que.front();
tmp.push_back(a->val);
if(a->left){
que.push(a->left);
}
if(a->right){
que.push(a->right);
}
que.pop();
}
vec.insert(vec.begin(),tmp);
}
return vec;
}
};