1、题目
https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal/submissions/
2、题意
题解1:bfs
和leetcode102一样 只需要多加一个cnt判断当前是否在偶数层即可,在将当前着一层的数组翻转
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
vector<vector<int>> res;
queue<TreeNode*> q;
if(root) q.push(root);
int cnt = 0;
while(q.size())
{
int len = q.size();
vector<int> level;
for(int i=0;i<len;i++)
{
auto p = q.front();
q.pop();
level.push_back(p->val);
if(p->left)
q.push(p->left);
if(p->right)
q.push(p->right);
}
if(++cnt%2==0) reverse(level.begin(),level.end());
res.push_back(level);
}
return res;
}
};