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}
,
3 / \ 9 20 / \ 15 7
return its bottom-up level order traversal as:
[ [15,7] [9,20], [3], ]
[Solution]
说明:版权所有,转载请注明出处。 Coder007的博客/**
* Definition for binary tree
* 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) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
// NULL node
vector<vector<int> > res;
if(root == NULL){
return res;
}
// initial
vector<TreeNode*> head;
head.push_back(root);
stack<vector<TreeNode*> > myStack;
myStack.push(head);
// level order traversal
while(!myStack.empty()){
vector<int> tmpRes;
vector<TreeNode*> tmp;
vector<TreeNode*> array = myStack.top();
myStack.pop();
// visit the offsprings
for(int i = 0; i < array.size(); ++i){
if(array[i]->left != NULL){
tmp.push_back(array[i]->left);
}
if(array[i]->right != NULL){
tmp.push_back(array[i]->right);
}
tmpRes.push_back(array[i]->val);
}
// add result
if(tmp.size() > 0){
myStack.push(tmp);
}
if(tmpRes.size() > 0){
res.insert(res.begin(), tmpRes);
}
}
return res;
}
};