Follow Carl To Grow|【LeetCode】144.二叉树的前序遍历，145.二叉树的后序遍历，94.二叉树的中序遍历

hudy_

已于 2024-06-09 16:17:01 修改

阅读量247

点赞数 6

分类专栏：拥抱算法文章标签： leetcode 算法职场和发展

于 2024-05-22 22:36:36 首次发布

本文链接：https://blog.csdn.net/hudy_/article/details/139130092

版权

拥抱算法专栏收录该内容

20 篇文章 0 订阅

订阅专栏

【LeetCode】144.二叉树的前序遍历

题意：给你二叉树的根节点 root ，返回它节点值的前序遍历。

思路：递归根左右。迭代用栈，实际出栈顺序上左右要颠倒。

代码A：

/**
 * 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:
    void pre(TreeNode *root, vector<int> &order)
    {
        if (!root)
        {
            return;
        }
        order.push_back(root->val);
        pre(root->left, order);
        pre(root->right, order);
    }

    vector<int> preorderTraversal(TreeNode* root) {
        vector<int> res;
        pre(root, res);
        return res;
    }
};

代码B：

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

【LeetCode】145.二叉树的后序遍历

题意：给你一棵二叉树的根节点 root ，返回其节点值的后序遍历。

思路：递归左右根。迭代用栈，可以先序基础上做反转，也就是根右左，然后用栈还要注意左右顺序反过来。

代码：

/**
 * 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:
    void post(TreeNode* root, vector<int> &order)
    {
        if (!root)
        {
            return;
        }
        post(root->left, order);
        post(root->right, order);
        order.push_back(root->val);
    }

    vector<int> postorderTraversal(TreeNode* root) {
        vector<int> res;
        post(root, res);
        return res;
    }
};

代码B：

/**
 * 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> postorderTraversal(TreeNode* root) {
        stack<TreeNode*> stk;
        vector<int> res;
        if (!root)
        {
            return res;
        }
        stk.push(root);
        while (!stk.empty())
        {
            TreeNode* node = stk.top();
            stk.pop();
            res.push_back(node->val);
            if (node->left)
            {
                stk.push(node->left);
            }              
            if (node->right)
            {
                stk.push(node->right);
            }
        }
        reverse(res.begin(), res.end());
        return res;
    }
};

【LeetCode】94.二叉树的中序遍历

题意：给定一个二叉树的根节点 root ，返回它的中序遍历。

思路：递归左根右。迭代访问的元素和要处理的元素顺序是不一致的，访问从根开始，处理要最左边开始，所以用栈存储直到最左边，然后用指针来记录访问顺序。当没有左孩子时，处理中间，然后去右边。

代码A：

/**
 * 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:
    void in(TreeNode* root, vector<int> &order)
    {
        if (!root)
        {
            return;
        }
        in(root->left, order);
        order.push_back(root->val);
        in(root->right, order);
    }

    vector<int> inorderTraversal(TreeNode* root) {
        vector<int> res;
        in(root, res);
        return res;
    }
};

代码B：

/**
 * 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) {
        stack<TreeNode*> stk;
        vector<int> res;
        TreeNode* cur = root;
        while (cur || !stk.empty())
        {
            if (cur)
            {
                stk.push(cur);
                cur = cur->left;
            }
            else
            {
                cur = stk.top();
                stk.pop();
                res.push_back(cur->val);
                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 {
public:
    vector<int> preorderTraversal(TreeNode* root) {
        stack<TreeNode*> stk;
        vector<int> res;
        if (!root)
        {
            return res;
        }
        stk.push(root);
        while (!stk.empty())
        {
            TreeNode* node = stk.top();
            if (node)
            {
                // 中左右->右左中
                stk.pop();
                if (node->right)
                {
                    stk.push(node->right);
                }
                if (node->left)
                {
                    stk.push(node->left);
                }
                stk.push(node);
                stk.push(NULL);
            }
            else
            {
                stk.pop();
                TreeNode *node = stk.top();
                stk.pop();
                res.push_back(node->val);
            }
        }
        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 {
public:
    vector<int> inorderTraversal(TreeNode* root) {
        stack<TreeNode*> stk;
        vector<int> res;
        if (!root)
        {
            return res;
        }
        stk.push(root);
        while(!stk.empty())
        {
            TreeNode *node = stk.top();
            // 左中右->右中左
            if (node)
            {
                stk.pop();
                if (node->right)
                {
                    stk.push(node->right);
                }
                stk.push(node);
                stk.push(NULL);
                if (node->left)
                {
                    stk.push(node->left);
                }
            }
            else
            {
                stk.pop();
                node = stk.top();
                stk.pop();
                res.push_back(node->val);
            }
        }
        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 {
public:
    vector<int> postorderTraversal(TreeNode* root) {
        stack<TreeNode*> stk;
        vector<int> res;
        if (!root)
        {
            return res;
        }
        stk.push(root);
        while (!stk.empty())
        {
            TreeNode* node = stk.top();
            if (node)
            {
                // 左右中->中右左
                stk.pop();
                stk.push(node);
                stk.push(NULL);
                if (node->right)
                {
                    stk.push(node->right);
                }
                if (node->left)
                {
                    stk.push(node->left);
                }
            }
            else
            {
                stk.pop();
                node = stk.top();
                stk.pop();
                res.push_back(node->val);
            }
        }
        return res;
    }
};