LeetCode Problem : Binary Tree Zigzag Level Order Traversal

Problem

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]
]

Code

vector<vector<int> > zigzagLevelOrder(TreeNode *root) {
    // IMPORTANT: Please reset any member data you declared, as
    // the same Solution instance will be reused for each test case.
    map<TreeNode *,int> level;
    deque<TreeNode *> Q;
    int levelNum = 0;
    vector<vector<int> > result;
    if(root){
        Q.push_back(root);
        level[root] = levelNum;
        if(result.size() == levelNum)
        result.resize(2*levelNum + 1);
        result[levelNum].push_back(root->val);
    }
    while(!Q.empty()){
        TreeNode *node = Q.front();
        Q.pop_front();
        if(node->left){
            levelNum = level[node] + 1;
            Q.push_back(node->left);
            level[node->left] = levelNum;
            if(result.size() == levelNum)
                result.resize(2*levelNum + 1);
            result[levelNum].push_back(node->left->val);
        }
        if(node->right){
            levelNum = level[node] + 1;
            Q.push_back(node->right);
            level[node->right] = levelNum;
            if(result.size() == levelNum)
                result.resize(2*levelNum + 1);
            result[levelNum].push_back(node->right->val);
        }
    }
    if(result.empty())
        return result;
    vector<vector<int> > tmp(result.begin(),result.begin() + levelNum +1);
    int n = tmp.size();
    vector<vector<int> > tmp1(n);
    for(int i = 0;i < n; ++i){
        if(i % 2 == 0)
            tmp1[i] = vector<int>(tmp[i].begin(),tmp[i].end());
        else
            tmp1[i] = vector<int>(tmp[i].rbegin(),tmp[i].rend());
    }
    return tmp1;
}