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?

前序遍历：

同前一篇文章一样，也可以有两种，递归和迭代。

递归如下：

/**
 * 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) {
        m_preorderfun(root);
		return m_vec;
    }
private:
	void m_preorderfun(TreeNode* root)
	{
		if (root == NULL)
		{
			return;
		}
		TreeNode* leftnode = root->left;
		TreeNode* rightnode = root->right;
		m_vec.push_back(root->val);
		if (leftnode)
		{
			m_preorderfun(leftnode);
		}

		if (rightnode)
		{
			m_preorderfun(rightnode);
		}	
	}
	vector<int> m_vec;
};

迭代如下：

采用栈的方式存储返回路劲。

/**
 * 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)
	{
		if (root == NULL)
		{
			return m_vec;
		}
		TreeNode* pNode = root;
		do 
		{
			while (pNode!=NULL)
			{
				m_vec.push_back(pNode->val);
				if (pNode->right!=NULL)
				{
					m_stac.push(pNode->right);
				}
				pNode = pNode->left;
			}
			if (m_stac.empty()==false)
			{
				pNode = m_stac.top();
				m_stac.pop();
			}
		} while (pNode!=NULL);	
		return m_vec;
	}
	
private:
	stack<TreeNode*>m_stac;
	vector<int> m_vec;
};