[leetcode][tree] 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]
]

/**
 * 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) {
        vector<vector<int> > res;
        if(NULL == root) return res;
        queue<TreeNode *> q;
        q.push(root);
        vector<int> oneLevel;
        int numOfCurLevelElem = 1;
        int numOfNextLevelElem = 0;
        bool flag = false;
        while(!q.empty()){
            for(int i = 0; i < numOfCurLevelElem; ++i){
                TreeNode *pCur = q.front();
                q.pop();
                oneLevel.push_back(pCur->val);
                if(pCur->left){
                    q.push(pCur->left);
                    ++numOfNextLevelElem;
                }
                if(pCur->right){
                    q.push(pCur->right);
                    ++numOfNextLevelElem;
                }
            }
            if(flag) reverse(oneLevel.begin(), oneLevel.end());//翻转本层遍历结果
            res.push_back(oneLevel);
            oneLevel.clear();
            flag ^= 1;//对flag取反
            numOfCurLevelElem = numOfNextLevelElem;
            numOfNextLevelElem = 0;
        }
        return res;
    }
};