遇到一个mark表示读到一行
/**
* 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) {
queue<TreeNode*> que;
vector<vector<int>> vec;
vector<int> tmp;
int flag = 2;// from right to left
TreeNode* mark = new TreeNode(0);
if (root != NULL) {//
que.push(root);
que.push(mark);
}
while (!que.empty()) {
TreeNode* stmp = que.front();
que.pop();// front pop
if (stmp == mark) {
if (que.size() > 0) {// 遇到标记,且que.size>0说明上一层已经遍历完毕,放入标记作为下一个遍历标记
que.push(mark);
}
if (flag == 1) {
flag = 2;
reverse(tmp.begin(), tmp.end());
}
else
flag = 1;
vec.push_back(tmp);// que.size()==0 && vec.push_back(tmp) is process to end
tmp.clear();
}
else {//
if (stmp != mark) {
tmp.push_back(stmp->val);
}
if (stmp->left != NULL)
que.push(stmp->left);
if (stmp->right != NULL)// 如果这边叶子节点放入左右孩子为NULL,遇到标记极为最后一个标记,结束
que.push(stmp->right);
}
}
return vec;
}
};