题解 | #二叉树的后序遍历# | C++

/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 *	TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 * };
 */
#include <vector>
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param root TreeNode类 
     * @return int整型vector
     */
    vector<int> postorderTraversal(TreeNode* root) {
        std::vector<int> ans;
        dfs(root, &ans);
        return ans;
    }

    void dfs(TreeNode* node, std::vector<int>* array) {
        if (node == nullptr) return;
        dfs(node->left, array);
        dfs(node->right, array);
        array->push_back(node->val);
    }
};