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

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

    void pointer(TreeNode *tree,vector<int> &it)
    {
        if(tree!=nullptr)
        {
            pointer(tree->left, it);
            pointer(tree->right, it);
            it.push_back(tree->val);
        }
    }
    vector<int> postorderTraversal(TreeNode* root) {
        // write code here
        vector<int> arr;
        pointer(root,arr);
        return arr;
    }
};