[LeetCode] Binary Tree Postorder Traversal [递归版]

题目：

Given a binary tree, return the postorder traversal of its nodes' values.

For example:
Given binary tree {1,#,2,3},

   1
    \
     2
    /
   3

return [3,2,1].

Note: Recursive solution is trivial, could you do it iteratively?

解答：

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> ret;
    vector<int> postorderTraversal(TreeNode *root) {
        if(root == NULL) {
            return ret;
        }
        postorderTraversal(root->left);
        postorderTraversal(root->right);
        ret.push_back(root->val);
        
        return ret;
    }
};

思路：递归解法，没啥好说的