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

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

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

class Solution {
public:
    vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
        vector<vector<int>> ans;
        if(!root)return ans;
        list<TreeNode*> q;
        q.push_back(root);
        bool direction=true;
        while(!q.empty()){
            int size=q.size();
            vector<int> tmp;
            if(direction){
                for(int i=0;i<size;i++){
                    TreeNode* node=q.front();
                    q.pop_front();
                    tmp.push_back(node->val);
                    if(node->left)q.push_back(node->left);
                    if(node->right)q.push_back(node->right);
                }
            }
            else{
                for(int i=size-1;i>=0;i--){
                    TreeNode* node=q.back();
                    q.pop_back();
                    tmp.push_back(node->val);
                    if(node->right)q.push_front(node->right);
                    if(node->left)q.push_front(node->left);
                }
            }
            ans.push_back(tmp);
            direction=!direction;
        }
        return ans;
    }
};