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

题目内容

给定一个二叉树，返回其节点值的锯齿形层序遍历。（即先从左往右，再从右往左进行下一层遍历，以此类推，层与层之间交替进行）。

例如：
给定二叉树 [3,9,20,null,null,15,7],

  3
 / \
 9  20
  /  \
15   7

返回锯齿形层序遍历如下：

[
 [3],
 [20,9],
 [15,7]
]

解题思路

使用双栈迭代
我出了bug，解决之后补原因
//未解决写一个替代方法附于末尾

解题代码

/**
 * 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) {
        stack<TreeNode*> t;
        stack<TreeNode*>t1;
        t.push(root);
        vector<vector<int>> ans;
        while(!t.empty()||!t1.empty())
        {
            vector<int> tem;tem.resize(0);
            if(!t.empty())
            {
                while(!t.empty())
                {
                    if(t.top()!=NULL)
                    {
                        tem.push_back(t.top()->val);t1.push(t.top()->left);t1.push(t.top()->right);
                    }
                    t.pop();
                }
            }
            else
            {
                while(!t1.empty())
                {
                    if(t1.top()!=NULL)
                    {
                        tem.push_back(t.top()->val);t.push(t1.top()->right);t.push(t1.top()->left);
                    }
                    t1.pop();
                }
                
            }
            ans.push_back(tem);
        }
        return ans;
    }
};

替代方法

/**
 * 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) {
        stack<TreeNode*> t;
        stack<TreeNode*>t1;
        t.push(root);
        vector<vector<int>> ans;if(!root)return ans;
        while(!t.empty()||!t1.empty())
        {
            vector<int> tem;
            if(!t.empty())
            {
                while(!t.empty())
                {
                    TreeNode* tn=t.top();
                    t.pop();
                    if(tn)
                    {
                        tem.push_back(tn->val);t1.push(tn->left);t1.push(tn->right);
                    }
                    
                }
                
            }
            else
            {
                while(!t1.empty())
                {
                    TreeNode* tn=t1.top();
                    t1.pop();
                    if(tn!=NULL)
                    {
                        tem.push_back(tn->val);t.push(tn->right);t.push(tn->left);
                    }
                }
                
            }
            if(tem.size())ans.push_back(tem);
        }
        return ans;
    }
};