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> postorderTraversal(TreeNode *root)     {        vector<int> res;        postorderTraversal(root, res);        return res;    }    void postorderTraversal(TreeNode *root, vector<int>& res)     {        if(root==NULL)            return;        postorderTraversal(root->left, res);        postorderTraversal(root->right, res);        res.push_back(root->val);    }};