LeetCode - Binary Tree Preorder Traversal

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

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

   1
    \
     2
    /
   3

return [1,2,3].

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

Recursive solution:

/**
 * 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> preorderTraversal(TreeNode *root) {
        vector<int> result;
        if(root==NULL){
            return result;
        }
        result.push_back(root->val);
        if(root->left!=NULL){
            vector<int> leftResult = preorderTraversal(root->left);
            result.insert(result.end(),leftResult.begin(),leftResult.end());
        }
        if(root->right!=NULL){
            vector<int> rightResult = preorderTraversal(root->right);
            result.insert(result.end(),rightResult.begin(),rightResult.end());
        }
        return result;
    }
};

Iterative solution:

/**
 * 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> preorderTraversal(TreeNode *root) {
        vector<int> result;
        if(root==NULL){
            return result;
        }
        stack<TreeNode*> nodeStack;
        nodeStack.push(root);
        while(!nodeStack.empty()){
            TreeNode* tmp = nodeStack.top();
            result.push_back(tmp->val);
            nodeStack.pop();
            if(tmp->right!=NULL){
                nodeStack.push(tmp->right);
            }
            if(tmp->left!=NULL){
                nodeStack.push(tmp->left);
            }
        }
        return result;
    }
};