力扣 103. 二叉树的锯齿形层次遍历 栈 模拟

https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal/

思路：搞两个栈模拟一下即可，具体看代码。

/**
 * 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>> vec;
        if(!root)
            return vec;
        stack<TreeNode*> odd,even;
        odd.push(root);
        TreeNode *tmp;
        while(!odd.empty()||!even.empty()){
            vector<int> t;
            if(!odd.empty()){
                while(!odd.empty()){
                    tmp=odd.top();
                    odd.pop();
                    if(tmp->left)
                        even.push(tmp->left);
                    if(tmp->right)
                        even.push(tmp->right);
                    t.push_back(tmp->val);
                }
            }
            else{
                while(!even.empty()){
                    tmp=even.top();
                    even.pop();
                    if(tmp->right)
                        odd.push(tmp->right);
                    if(tmp->left)
                        odd.push(tmp->left);
                    t.push_back(tmp->val);
                }
            }
            vec.push_back(move(t));
        }
        return vec;
    }
};