OJ Lintcode 二叉树的后序遍历

给出一棵二叉树，返回其节点值的后序遍历。

/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */
class Solution {
    /**
     * @param root: The root of binary tree.
     * @return: Postorder in vector which contains node values.
     */
public:
    void postorder_tra(TreeNode * p,vector<int> & vi){
        if(p!=NULL){
            postorder_tra(p->left,vi);
            postorder_tra(p->right,vi);
            vi.push_back(p->val);
        }
        
    }
    vector<int> postorderTraversal(TreeNode *root) {
        // write your code here
        vector<int> vi;
        postorder_tra(root,vi);
        return vi;
    }
};