问题描述
解题报告
实现代码
class Solution {
public:
vector<vector<int>> levelOrderBottom(TreeNode* root) {
vector<vector<int>> ans;
vector<vector<int>> temp;
if(!root){
return ans;
}
vector<int> singleItem;
queue<TreeNode*>q;
q.push(root);
while(!q.empty()){
int size=q.size();
for(int i=0;i<size;i++){
singleItem.push_back(q.front()->val);
if(q.front()->left) q.push(q.front()->left);
if(q.front()->right) q.push(q.front()->right);
q.pop();
}
if(!singleItem.empty()){
ans.push_back(singleItem);
singleItem.clear();
}
}
for(int i=ans.size()-1;i>=0;i--){
temp.push_back(ans[i]);
}
return temp;
}
};