二叉树遍历C++实现——深度优先_二叉树的深度优先遍历(先根遍历)c++代码-优快云博客

本文链接：https://blog.youkuaiyun.com/weixin_43591948/article/details/120190846

这篇博客介绍了如何使用递归法实现二叉树的前序、中序和后序遍历。提供的代码示例展示了在C++中遍历树节点并收集节点值的方法。在前序遍历中，先访问根节点，再遍历左子树，最后遍历右子树；中序遍历则是在遍历左子树后访问根节点，然后遍历右子树；后序遍历则是先遍历左右子树，最后访问根节点。

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

前序遍历

struct TreeNode {
    int val;
    TreeNode* left;
    TreeNode* right;
    TreeNode() :val(0), left(nullptr), right(nullptr) {};
    TreeNode(int x, TreeNode* left, TreeNode* right) :val(x), left(left), right(right) {};
};
//递归法
class Solution {
public:
    void preorder(TreeNode* root, vector<int>& res) {
        if (root == nullptr) {
            return;
        }
        res.push_back(root->val);
        preorder(root->left, res);
        preorder(root->right, res);
    }

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

中序遍历

int ans1;
int ans2;
struct TreeNode {
    int val;
    TreeNode* left;
    TreeNode* right;
    TreeNode() :val(0), left(nullptr), right(nullptr) {};
    TreeNode(int x, TreeNode* left, TreeNode* right) :val(x), left(left), right(right) {};
};
class Solution {
public:
    void inorder(TreeNode* root, vector<int>& res) {
        if (!root) {
            ans2 = max(ans2, ans1);
            return;
        }
        ans1 += 1;
        inorder(root->left, res);
        res.push_back(root->val);
        inorder(root->right,res);
    }
    vector<int> inorderTraversal(TreeNode* root) {
        vector<int> res;
        ans2 = 0;
        ans1 = 0;
        inorder(root, res);
        return res;
    }
};

后序遍历

struct TreeNode {
    int val;
    TreeNode* left;
    TreeNode* right;
    TreeNode() :val(0), left(nullptr), right(nullptr) {};
    TreeNode(int x, TreeNode* left, TreeNode* right) :val(x), left(left), right(right) {};
};
//递归法
class Solution {
public:
    void preorder(TreeNode* root, vector<int>& res) {
        if (root == nullptr) {
            return;
        }
        
        preorder(root->left, res);
        preorder(root->right, res);
        res.push_back(root->val);
    }

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