标签：cnt return level res 二叉树 push 103 root LeetCode
class Solution {
public:
vector<vector<int>> res;
void bfs(TreeNode* root)
{
queue<TreeNode*> q;
q.push(root);
int cnt=0;
while(!q.empty())
{
vector<int> level;
int len=q.size();
cnt++;
while(len--)
{
auto t=q.front();
q.pop();
level.push_back(t->val);
if(t->right) q.push(t->right);
if(t->left) q.push(t->left);
}
if(cnt&1) reverse(level.begin(),level.end());
res.push_back(level);
}
return;
}
vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
if(!root) return res;
bfs(root);
return res;
}
};
标签：cnt,
return,
level,
res,
二叉树,
push,
103,
root,
LeetCode
From： https://www.cnblogs.com/tangxibomb/p/17420371.html