![](https://i-blog.csdnimg.cn/blog_migrate/e39e77eb734b57bd21e75b2638196ffa.png)
/**
* 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>> res;
if(root==NULL)return res;
queue<TreeNode*>q;
q.push(root);
int cnt=1;
while(!q.empty()){
int s=q.size();
int i;
deque<int>l;
for(i=1;i<=s;i++){
auto t=q.front();
q.pop();
if(cnt==1){
l.push_back(t->val);
}else{
l.push_front(t->val);
}
if(t->left)q.push(t->left);
if(t->right)q.push(t->right);
}
vector<int>k={l.begin(),l.end()};
res.push_back(k);
cnt=-cnt;
}
return res;
}
};
这边主要注意deque的使用