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:

/**
 * 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) {
       preOrder(root);
       return result;
    }
private:
    void preOrder(TreeNode* root)
    {
         if(root == NULL)
            return;
         else
         {
            result.push_back(root->val);
            preOrder(root->left);
            preOrder(root->right);
           
         }
    }
    
    vector<int> result;
};

Iterate:

/**
 * 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) {
        TreeNode* top = NULL;
        //TreeNode* pre = root;
        if(root == NULL)
            return result;
        else
        {
            m_stack.push(root);
            while(!m_stack.empty())
            {
                top = m_stack.top();
                
                result.push_back(top->val);
                m_stack.pop();
               
                if(top->right)
                    m_stack.push(top->right);
                if(top->left)
                    m_stack.push(top->left);
                   
            }
            
        }
        return result;

    }
private:
    vector<int> result;    
    stack<TreeNode*> m_stack;
};

Round 2:

class Solution {
public:
    vector<int> preorderTraversal(TreeNode *root) {
        vector<int> result;
        stack<TreeNode *> bfs;
        bfs.push(root);
        while(!bfs.empty())
        {
            TreeNode *cur = bfs.top();
            bfs.pop();
            if(cur)
            {
                result.push_back(cur->val);
                bfs.push(cur->right);
                bfs.push(cur->left);
                
            }
        }
        return result;
    }
};