145---二叉树后序遍历 难度：中等

  class Solution {
public:
    vector<int> res;
    vector<int> postorderTraversal(TreeNode* root) 
    {   
        if(root==NULL)
        {
            return res;
        }
        postorder(root);
        return res;
        
    }
    void postorder(TreeNode* root)
    {
        if(root==NULL)
            return;
        postorder(root->left);
        postorder(root->right);
        res.push_back(root->val);
    }
};