【代码随想录算法训练营第37期 第十四天 | LeetCode144.二叉树的前序遍历、94.二叉树的中序遍历、145.二叉树的后序遍历】

代码随想录算法训练营第37期 第十四天 | LeetCode144.二叉树的前序遍历、94.二叉树的中序遍历、145.二叉树的后序遍历

---

一、144.二叉树的前序遍历

解题代码C++：

/**
 * 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 traversal(TreeNode* cur, vector<int>& vec)
    {
        if(cur == NULL) return;
        vec.push_back(cur->val);
        traversal(cur->left, vec);
        traversal(cur->right, vec);
    }

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

题目链接/文章讲解/视频讲解：
https://programmercarl.com/%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%80%92%E5%BD%92%E9%81%8D%E5%8E%86.html

---

---

二、94.二叉树的中序遍历

解题代码C++：

class Solution {
public:
    void traversal(TreeNode* cur, vector<int>& vec)
    {
        if(cur == NULL) return;
        traversal(cur->left, vec);
        vec.push_back(cur->val);
        traversal(cur->right, vec);
    }

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

题目链接/文章讲解/视频讲解：
https://programmercarl.com/%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%80%92%E5%BD%92%E9%81%8D%E5%8E%86.html

---

---

三、145.二叉树的后序遍历

解题代码C++：

class Solution {
public:
    void traversal(TreeNode* cur, vector<int>& vec)
    {
        if(cur == NULL) return;
        traversal(cur->left, vec);
        traversal(cur->right, vec);
        vec.push_back(cur->val);
    }

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

题目链接/文章讲解/视频讲解：
https://programmercarl.com/%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%80%92%E5%BD%92%E9%81%8D%E5%8E%86.html