/**
* 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
stack<vector<int>> stk;
vector<vector<int>> ans;
vector<int> vec;
int lev1=1,lev2=0;
TreeNode *p;
queue<TreeNode*> que;
if(root!=NULL)que.push(root);
while(!que.empty()){
p=que.front();
vec.push_back(p->val);
que.pop();
--lev1;
if(p->left!=NULL){
que.push(p->left);
++lev2;
}
if(p->right!=NULL){
que.push(p->right);
++lev2;
}
if(lev1==0){
stk.push(vec);
vec.clear();
lev1=lev2;
lev2=0;
}
}
while(!stk.empty()){
ans.push_back(stk.top());
stk.pop();
}
return ans;
}
};
Binary Tree Level Order Traversal II
最新推荐文章于 2019-05-28 11:08:57 发布