力扣 LeetCode 103. 二叉树的锯齿形层序遍历

用一个bfs，然后记录每层的层序为h,奇数层则让vector从头插入，偶数层从尾部插入即可

/**
 * 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<int>v;
        queue<TreeNode*>q;
        vector<vector<int>>res;
        if (root) q.push(root);
        int h=0;   
        while(!q.empty()){
            int len=q.size();
            vector<int>v;
            while(len>0){
                TreeNode* temp=q.front();
                len--;
                q.pop();
                if(h%2==1){
                    v.insert(v.begin(), temp->val);
                }
                else{
                    v.push_back(temp->val);
                }
                if(temp->left)q.push(temp->left);
                if(temp->right)q.push(temp->right);
            }
            res.push_back(v);
            h++;
        }
        return res;
    }
};