145:Binary Tree Postorder Traversal【樹】【棧】

題目鏈接：click~

/*題意：二叉樹的後序遍歷*/
class Solution {
public:
    void PostOrderTraverse(TreeNode *T, vector<int> &v) {
        if(T == NULL) return;
        PostOrderTraverse(T->left, v);
        PostOrderTraverse(T->right, v);
        v.push_back(T->val);
    }
    vector<int> postorderTraversal(TreeNode *root) {
        vector<int> v;
        PostOrderTraverse(root, v);
        return v;
    }
};