[LeetCode-Algorithms-144] "Binary Tree Preorder Traversal" (2017.12.21-WEEK16)

题目链接：Binary Tree Preorder Traversal

• 
  
• 题目描述：
  

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

For example:

Given binary tree [1,null,2,3],

   1
    \
     2
    /
   3

return [1,2,3].

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

---

(1)思路：用前序的方式遍历二元树并将节点的值存入向量;

(2)代码：

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

(3)提交结果：