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?

Solution:

Code:

<span style="font-size:14px;">/**
 * 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> result;
        if (root == NULL) return result;
        stack<TreeNode *> stk;
        stk.push(root);
        TreeNode *left, *right;
        while (!stk.empty()) {
            root = stk.top();
            stk.pop();
            if (root->left == NULL && root->right == NULL)
                result.push_back(root->val);
            else {
                left = root->left;
                root->left = NULL;
                right = root->right;
                root->right = NULL;
                stk.push(root);
                if (right) stk.push(right);
                if (left) stk.push(left);
            }
        }
        return result;
    }
};</span>