题解 | #递归方式——二叉树的后序遍历#

/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 *	TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 * };
 */
 //递归方式的后序遍历
#include <stack>
#include <vector>
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param root TreeNode类 
     * @return int整型vector
     */
    void post_order(TreeNode *Node,vector<int>&ans){
        if(Node == NULL) return;
        post_order(Node->left, ans);
        post_order(Node->right,ans);
        ans.push_back(Node->val);
     }
    vector<int> postorderTraversal(TreeNode* root) {
        // write code here
        vector<int> ans;
        post_order(root, ans);
        return ans;
    }
};