本系列产生的一切目的为督促本人早起。
今日题目:https://leetcode.cn/problems/reverse-odd-levels-of-binary-tree/description/
BFS喵
套模板就好力
class Solution {
public:
TreeNode* reverseOddLevels(TreeNode* root) {
queue<TreeNode*> q({root});
for(int i=0;q.size();++i){
vector<TreeNode*> col;
for(int k=q.size();k;--k){
TreeNode* cur_node = q.front();
q.pop();
if(i%2 ==1){
col.push_back(cur_node);
}
if(cur_node->left){
q.push(cur_node->left);
q.push(cur_node->right);
}
}
for(int l=0,r=col.size()-1;l<r;++l,--r){
swap(col[l]->val,col[r]->val);
}
}
return root;
}
};