LeetCode: 前序遍历

给定一个二叉树，返回它的 前序 遍历。

 示例:

输入: [1,null,2,3]  
   1
    \
     2
    /
   3 

输出: [1,2,3]

进阶: 递归算法很简单，你可以通过迭代算法完成吗？

/**
 * 递归版本
 * Definition for a binary tree node.
 * 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> temp;
        if(!root)
            return temp;
        temp.push_back(root->val);
        if(root->left){
            vector<int> left;
            left = preorderTraversal(root->left);
            temp.insert(temp.end(),left.begin(),left.end());
        }
        if(root->right){
            vector<int> right;
            right = preorderTraversal(root->right);
            temp.insert(temp.end(),right.begin(), right.end());
        }
        return temp;
    }
};

/**
 * 迭代版本
 * Definition for a binary tree node.
 * 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> ans;
        stack<TreeNode*> s;
        TreeNode* pt;
        if(!root)
            return ans;
        s.push(root);
        while(s.size()){
            pt = s.top();
            s.pop();
            ans.push_back(pt->val);
            if(pt->right)
                s.push(pt->right);
            if(pt->left)
                s.push(pt->left);
        }
        return ans;
    }
};