给定一个二叉树,返回其节点值自底向上的层次遍历。 (即按从叶子节点所在层到根节点所在的层,逐层从左向右遍历)
例如:
给定二叉树 [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>> vecRes;
if(root == NULL)
return vecRes;
stack<vector<int>> sta;
queue<TreeNode *> que;
que.push(root);
while(!que.empty())
{
vector<int> vecTmp;
int len = que.size();
for(int i=0;i<len;i++)
{
TreeNode * pNode = que.front();
if(pNode->left)
que.push(pNode->left);
if(pNode->right)
que.push(pNode->right);
vecTmp.push_back(pNode->val);
que.pop();
}
sta.push(vecTmp);
}
while(!sta.empty())
{
vecRes.push_back(sta.top());
sta.pop();
}
return vecRes;
}
};