题目链接：https://oj.leetcode.com/problems/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 {
private:
    vector<int> s;
public:
    vector<int> postorderTraversal(TreeNode *root) {
        postOrder(root);
        return s;
    }
    void postOrder(TreeNode *root) {
        if (root == NULL) return;
        postOrder(root->left);
        postOrder(root->right);
        s.push_back(root->val);
    }
};

LeetCode-Binary Tree Postorder Traversal