/**
* Definition for binary tree
* 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>> ret;
ret.clear();
if(root==NULL) return ret;
vector<int> tmp;
queue<TreeNode*> q;
int flag=0;
q.push(root);
q.push(NULL);
while(!q.empty())
{
TreeNode *p=q.front();
q.pop();
if(p!=NULL)
{
tmp.push_back(p->val);
if(p->left)
q.push(p->left);
if(p->right)
q.push(p->right);
}
else
{ if(!tmp.empty())
{
q.push(NULL);//一定注意啊
if(flag==1)
reverse(tmp.begin(),tmp.end());//一定注意啊
ret.push_back(tmp);
flag=1-flag;
tmp.clear();
}
}
}
return ret;
}
};
* Definition for binary tree
* 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>> ret;
ret.clear();
if(root==NULL) return ret;
vector<int> tmp;
queue<TreeNode*> q;
int flag=0;
q.push(root);
q.push(NULL);
while(!q.empty())
{
TreeNode *p=q.front();
q.pop();
if(p!=NULL)
{
tmp.push_back(p->val);
if(p->left)
q.push(p->left);
if(p->right)
q.push(p->right);
}
else
{ if(!tmp.empty())
{
q.push(NULL);//一定注意啊
if(flag==1)
reverse(tmp.begin(),tmp.end());//一定注意啊
ret.push_back(tmp);
flag=1-flag;
tmp.clear();
}
}
}
return ret;
}
};