非递归遍历二叉树

最新推荐文章于 2023-04-26 15:06:58 发布

OracleDesire

最新推荐文章于 2023-04-26 15:06:58 发布

阅读量757

点赞数

分类专栏： LeetCode 经典算法

本文链接：https://blog.csdn.net/u013086906/article/details/18056337

版权

LeetCode 同时被 2 个专栏收录

111 篇文章 0 订阅

订阅专栏

经典算法

6 篇文章 0 订阅

订阅专栏

前序遍历：

/**
 * 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<int> preorderTraversal(TreeNode *root) {
        vector<int> res;
        stack<TreeNode *> s;
        TreeNode *p = root;
        while (p != NULL || !s.empty()) {
            while (p != NULL) {
                res.push_back(p->val);
                s.push(p);
                p = p->left;
            }
            if (!s.empty()) {
                p = s.top();
                s.pop();
                p = p->right;
            }
        }
        return res;
    }
};

中序遍历：

/**
 * 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<int> inorderTraversal(TreeNode *root) {
        vector<int> res;
        stack<TreeNode *> s;
        TreeNode *p = root;
        while (p != NULL || !s.empty()) {
            while (p != NULL) {
                s.push(p);
                p = p->left;
            }
            if (!s.empty()) {
                p = s.top();
                s.pop();
                res.push_back(p->val);
                p = p->right;
            }
        }
        return res;
    }
};

后序遍历：

/**
 * 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<int> postorderTraversal(TreeNode *root) {
        vector<int> res;
        if (!root)
            return res;
        stack<TreeNode *> s;
        TreeNode *cur = root, *pre = NULL;
        s.push(cur);
        while (!s.empty()) {
            cur = s.top();
            if (((cur->left == NULL) && (cur->right == NULL)) 
                || ((pre != NULL) && ((pre == cur->left) || (pre == cur->right)))) {
                    res.push_back(cur->val);
                    pre = cur;
                    s.pop();
                }
            else {
                if (cur->right != NULL)
                    s.push(cur->right);
                if (cur->left != NULL)
                    s.push(cur->left);
            }
        }
        return res;
    }
};