C++速通LeetCode简单第8题-二叉树的中序遍历

程序猿练习生

已于 2024-09-14 10:53:50 修改

阅读量24

点赞数 2

分类专栏： LeetCode c++ 文章标签： c++ leetcode 链表

于 2024-09-14 10:53:15 首次发布

本文链接：https://blog.csdn.net/weixin_47768406/article/details/142252889

版权

c++ 同时被 2 个专栏收录

71 篇文章 0 订阅

订阅专栏

LeetCode

12 篇文章 0 订阅

订阅专栏

方法一：迭代法

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    vector<int> inorderTraversal(TreeNode* root) {
        vector<int> res;
        TreeNode* cur = root;
        stack<TreeNode*> stk;
        while(cur||stk.size())
        {
            while(cur)
            {
                stk.push(cur);
                cur = cur->left;
            }
                cur = stk.top();
                res.push_back(cur->val);
                stk.pop();
                cur = cur->right;
        }
        return res;
    }
};

方法二：颜色标记法：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
typedef pair<TreeNode*, int> PTI;
public:
    vector<int> order;
    vector<int> inorderTraversal(TreeNode* root) {
        //数据包类型
        stack<PTI> stk;
        stk.push({root, 0});
        while (stk.size()) {
           auto [t, color] = stk.top(); stk.pop();
           if (t == nullptr) continue;
           if (color == 0) {
               stk.push({t->right, 0});
               stk.push({t, 1});
               stk.push({t->left, 0});
           } else {
               order.push_back(t->val);
           }
        }
        return order;
    }
};