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 preorder(TreeNode *root,vector<int> &ret){
        if(root==nullptr)
            return ;
         //根->左->右
        ret.push_back(root->val);
        preorder(root->left,ret);
        preorder(root->right,ret);
    }
    vector<int> preorderTraversal(TreeNode* root) {
        vector<int> ret;
        //使用引用的方式传递值
        preorder(root,ret);
        return ret;
    }
};

后序遍历

与前序遍历相反，遍历方式：左子树 —> 右子树 —> 根结点

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