题目描述
思路分析
二叉树的层序遍历+BFS
II题和I题相比,就是最后把答案
r
e
v
e
r
s
e
reverse
reverse了一下。
代码实现
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<vector<int>> levelOrderBottom(TreeNode* root) {
vector<vector<int>> ans;
queue<TreeNode*> q;
if(root) q.push(root);
while(q.size()){
vector<int> path;
int len=q.size();
for(int i=1;i<=len;i++){
auto t=q.front();
q.pop();
path.push_back(t->val);
if(t->left) q.push(t->left);
if(t->right) q.push(t->right);
}
ans.push_back(path);
}
reverse(ans.begin(),ans.end());
return ans;
}
};