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?

// Source : https://oj.leetcode.com/problems/binary-tree-preorder-traversal/  
// Author : Chao Zeng  
// Date   : 2014-12-19 
struct TreeNode {
	int val;
	TreeNode *left;
	TreeNode *right;
	TreeNode(int x) : val(x),left(NULL),right(NULL){}
};

/*递归方法
class Solution {
public:
	vector<int> path;
	void preorder(TreeNode *root){
		if (!root)
			return;
		path.push_back(root->val);
		preorder(root->left);
		preorder(root->right);
	}
	vector<int> preorderTraversal(TreeNode *root) {
		preorder(root);
		return path;
	}
};
*/

//重点注意对指针的非空的判断，只能if(p==NULL) or if(p!=NULL)，不然提交一直RE
//非递归方法，空间复杂度O(n)
class Solution {
public:
	vector<int> preorderTraversal(TreeNode *root){
		vector<int> path;
		path.clear();
		if (root == NULL)
			return path;
		stack<TreeNode *> s;
		s.push(root);
		while (!s.empty()){
			TreeNode *p = s.top();
			s.pop();
			path.push_back(p->val);
			if (p->right != NULL)
				s.push(p->right);
			if (p->left != NULL)				
				s.push(p->left);
		}
		return path;
	}
};