[LeetCode]Binary Tree Zigzag Level Order Traversal

Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).

For example:
Given binary tree {3,9,20,#,#,15,7},

    3
   / \
  9  20
    /  \
   15   7

return its zigzag level order traversal as:

[
  [3],
  [20,9],
  [15,7]
]

          第一层从左到右，第二层从右到左，第三层从左到右

    首先想到的是，用flag 记录奇偶层， 0为奇，1为偶， 偶数的时候 push_back 整个一层元素到ret容器 之前 先reverse 一遍。只要改一点 层次遍历的代码

/**
 * 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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
            vector<vector<int> > ret;
			ret.clear();
			if(root == NULL)
				return ret;
			queue<TreeNode*> S;
			int flag = 0;
			S.push(root);
			S.push(NULL);
			vector<int> tmp;
			while(!S.empty()){
				//travesal current level
				TreeNode* p = S.front();
				S.pop();
				if(p!=NULL)
				{
					tmp.push_back(p->val);
					if(p->left) 
						S.push(p->left);
					if(p->right)
						S.push(p->right);
				}else{
					if(!tmp.empty())
					{	
						S.push(NULL);
						if(flag==1)
							reverse(tmp.begin(),tmp.end());
						ret.push_back(tmp);
						flag = 1 - flag;
						tmp.clear();
					}
				}
			}
            return ret;
    
    }
};