Binary Tree Zigzag Level Order Traversal

解析：层遍历
题目提示：from left to right, then right to left for the next level and alternate between. 即第一层从左往右 ，第二层从右往左，第三层从左往右，第四层从右往左…依次循环
可知：
1.偶数层从右往左读取节点，奇数层从左往右读取节点
2.难点在于：如何确定当前元素是同一层的节点

为了记录节点以及其所属的层数，采用pair键值对存储节点，key表示节点的指针，value表示节点所属的层数，当前节点的左右子树的层数是上一层节点的层数+1，利用队列保存节点，然后逐个获取节点的值，利用临时变量表示之前节点所属的层数，如果当前节点所属的层数与临时变量不同，则当前节点和之前的节点不在同一层，对上一层节点进行处理，若是偶数层，将序列反转

/**
 * 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 (root == NULL) return res;
        vector<int> sub_res;
        queue<pair<TreeNode*, int>> tree;
        int curlevel = 1;
        tree.push({root, curlevel});
        pair<TreeNode*, int> tree_node;
        
        while (!tree.empty()){
            tree_node = tree.front();
            tree.pop();
            if (curlevel != tree_node.second){
                if (curlevel % 2 == 0) //偶数层，反转序列
                    reverse(sub_res.begin(), sub_res.end());
                res.push_back(sub_res);
                sub_res.clear();
                curlevel = tree_node.second;
            }
            sub_res.push_back(tree_node.first->val);
            if (tree_node.first->left != NULL) 
                tree.push({tree_node.first->left, tree_node.second + 1});
            if (tree_node.first->right != NULL)
                tree.push({tree_node.first->right, tree_node.second + 1});
        }
        if (curlevel % 2 == 0)
            reverse(sub_res.begin(), sub_res.end());
        res.push_back(sub_res);
        return res;
    }
};