Binary Tree Postorder Traversal

Given a binary tree, return the postorder traversal of its nodes' values.

For example:
Given binary tree {1,#,2,3},

   1
    \
     2
    /
   3

return [3,2,1].

解题思路: 后序遍历的过程是首先左-右-父，首先按这样的顺序存入栈中，如果上一次输出的点为当前点的左右子结点，或者当前点为叶结点则可以输出，否则继续将当前点的左右结点压入栈中;

#include<iostream>
#include<vector>
#include<stack>
using namespace std;

struct TreeNode {
	int val;
	TreeNode *left;
	TreeNode *right;
	TreeNode(int x) : val(x), left(NULL), right(NULL) {}

};
vector<int> postorderTraversal(TreeNode *root) {
	vector<int>ResultVectorPsotorder;
	stack<TreeNode*>StackNode;
	if (root == NULL)
		return ResultVectorPsotorder;
	StackNode.push(root);
	TreeNode*CurNode = NULL;
	TreeNode* PreOutNode = NULL;
	while (!StackNode.empty()){
		CurNode = StackNode.top();
		if ((CurNode->right==NULL&&CurNode->left==NULL)||
			(PreOutNode!=NULL&&(PreOutNode == CurNode->left || PreOutNode == CurNode->right))){
			ResultVectorPsotorder.push_back(CurNode->val);
			StackNode.pop();
			PreOutNode = CurNode;
		}
		else{
			if (CurNode->right)
				StackNode.push(CurNode->right);
			if (CurNode->left)
				StackNode.push(CurNode->left);
		}
	}
	return ResultVectorPsotorder;
}