题目描述
思路分析
二叉树+BFS
和层序遍历相比,只需要多加个变量来判断正反即可。
代码实现
/**
* 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>> zigzagLevelOrder(TreeNode* root) {
vector<vector<int>> ans;
queue<TreeNode*> q;
if(root) q.push(root);
int flag=1;
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);
}
if((flag++)%2==0) reverse(path.begin(),path.end());
ans.push_back(path);
}
return ans;
}
};