二叉树的非递归 前序，中序，后序遍历

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

struct node
{
	int num;
	node *leftChild, *rightChild;
	node()
	{
		num = -1;
		leftChild = rightChild = NULL;
	}
};

void preOrder(node *root);
void preOrder1(node *root);
void inOrder(node *root);
void postOrder(node *root);

int main()
{
	
	
	
	node *n7 = new node(); n7->num = 7;
	node *n6 = new node(); n6->num = 6;
	node *n5 = new node(); n5->num = 5; n5->leftChild = n7;
	node *n4 = new node(); n4->num = 4;
	node *n2 = new node(); n2->num = 2; n2->leftChild = n4; n2->rightChild = n5;
	node *n3 = new node(); n3->num = 3; n3->rightChild = n6;
	node *n1 = new node(); n1->num = 1; n1->leftChild = n2; n1->rightChild = n3;
	preOrder(n1);
	preOrder1(n1);
	inOrder(n1);
	postOrder(n1);
	
	
	return 0;
}

void preOrder(node *root)
{
	stack<node *> nstack;
	node *p = root;
	do
	{
		while(p)
		{
			cout << p->num << " ";
			nstack.push(p);
			p = p->leftChild;
		}
		
		while(!nstack.empty())
		{
			p = nstack.top();
			nstack.pop();
			if(p->rightChild)
			{
				p = p->rightChild;
				break;
			}
			else
				p = NULL;
		}
		
	} while(!nstack.empty() || p);
	cout << endl;
}

void preOrder1(node *root)
{
	stack<node *> nstack;
	node *p = root;
	while(p)
	{
		cout << p->num << " ";
		if(p->rightChild)
			nstack.push(p->rightChild);
			
		if(p->leftChild)
			p = p->leftChild;
		else
		{
			if(!nstack.empty())
			{
				p = nstack.top();
				nstack.pop();
			}
			else
				p = NULL;
		}
	}
	cout << endl;
}

void inOrder(node *root)
{
	stack<node *> nstack;
	node *p = root;
	do
	{
		while(p)
		{
			nstack.push(p);
			p = p->leftChild;
		}
		if(!nstack.empty())
		{
			p = nstack.top();
			nstack.pop();
			cout << p->num << " ";
			if(p->rightChild)
				p = p->rightChild;
			else
				p = NULL;
		}
	} while(!nstack.empty() || p);
	cout << endl;
}

void postOrder(node *root)
{
	stack<node *> nstack;
	node *p = root;
	node *pre = NULL;
	do
	{
		while(p)
		{
			nstack.push(p);
			p = p->leftChild;
		}
		
		while(!nstack.empty())
		{
			p = nstack.top();
			if(!p->rightChild || p->rightChild == pre)
			{
				cout << p->num << " ";
				pre = p;
				p = NULL;
				nstack.pop();
			}
			else
			{
				p = p->rightChild;
				break;
			}
		}
	} while(!nstack.empty() || p);
	cout << endl;
}