[LeetCode OJ]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].

顺序容器还真是比较方便的，有了前面的中序和前序的基础，这个很简单。

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