BM24 二叉树的中序遍历

/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 *	TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 * };
 */
class Solution {
    private:
        vector<int> ans;
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param root TreeNode类 
     * @return int整型vector
     */
    vector<int> inorderTraversal(TreeNode* root) {
        // write code here
        inoder(root);
        return ans;
    }
    void inoder(TreeNode* root){
        if(root){
        inoder(root->left);
        ans.push_back(root->val);
        inoder(root->right);
        }
    }
};

BM25 二叉树的后序遍历

/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 *	TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 * };
 */
class Solution {
    private:
        vector<int> ans;
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param root TreeNode类 
     * @return int整型vector
     */
    vector<int> postorderTraversal(TreeNode* root) {
        // write code here
        postorder(root);
        return ans;
    }
    void postorder(TreeNode* root){
        if(root){
            postorder(root->left);
            postorder(root->right);
            ans.push_back(root->val);
        }
    }
};