二叉树后序遍历非递归

二叉树的后序遍历，非递归的方法

vector<int> postorderTraversal(TreeNode *root) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
//迭代
vector<int> v;
if(root==NULL)
return v;
stack<TreeNode *> s;
s.push(root);
while(s.empty()==false)
{
TreeNode *node=s.top();
if(node->right||node->left)
{
if(node->right)
{
s.push(node->right);
node->right=NULL;
}
if(node->left)
{
s.push(node->left);
node->left=NULL;
}
}
else
{
v.push_back(node->val);
s.pop();
}
}
return v;
}