leetcode z形遍历二叉树

最新推荐文章于 2024-03-23 21:50:15 发布

kotomi_du

最新推荐文章于 2024-03-23 21:50:15 发布

阅读量854

点赞数

CC 4.0 BY-SA版权

分类专栏：算法

本文链接：https://blog.youkuaiyun.com/github_38818603/article/details/81676168

算法专栏收录该内容

57 篇文章

订阅专栏

本文介绍了如何使用两个栈s1和s2解决LeetCode中的Z形遍历二叉树问题。通过巧妙地交替压入节点，实现了从左到右、从上到下再到左的Z字形遍历。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

key: use two stack s1,s2

/**
 * Definition for binary tree
 * 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;
        stack<TreeNode*> s1,s2;
        s1.push(root);
        vector<int> temp;
        while(!s1.empty() || !s2.empty()){
            
            while(!s1.empty()){
                TreeNode* cur = s1.top();
                temp.push_back(cur->val);
                s1.pop();
                if(cur->left) s2.push(cur->left);
                if(cur->right) s2.push(cur->right);
                
            }
            if(!temp.empty()) {
               res.push_back(temp);
               temp.clear();
            }
            while(!s2.empty()){
                TreeNode* cur = s2.top();
                temp.push_back(cur->val);
                s2.pop();
                if(cur->right) s1.push(cur->right);
                if(cur->left) s1.push(cur->left);
            }
            if(!temp.empty()) {
                res.push_back(temp);
                temp.clear();
            }
        }
        return res;
        
    }
};