LeetCode103. 二叉树的锯齿形层次遍历

vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
        deque<TreeNode*>q;
        vector<vector<int>>res;
        if (root==NULL)return res;
        else{
            q.push_back(root);
            bool dir=true;//标志位，指示从前往后还是从后往前遍历层级
            while(!q.empty())
            {
                int n=q.size();
                vector<int>r;
                for(int i=0;i<n;i++)
                {
                    if(dir)//注意遍历的方式和左右结点的插入位置
                    {
                        TreeNode *cur=q.front();
                        q.pop_front();
                        r.push_back(cur->val);
                        if(cur->left!=NULL)
                            q.push_back(cur->left);
                        if(cur->right!=NULL)
                            q.push_back(cur->right);
                    }
                    else{
                        TreeNode *cur=q.back();
                        q.pop_back();
                        r.push_back(cur->val);
                        
                        if(cur->right!=NULL)
                            q.push_front(cur->right);
                        if(cur->left!=NULL)
                            q.push_front(cur->left);
                    }
                }
                res.push_back(r);
                dir=!dir;//遍历一层后反过来遍历
            }
        }
        return res;
    }