二叉树-前序、中序、后序 遍历（C++代码实现）

A、三种遍历

（1）递归版

#include <iostream>
using namespace std;
//定义二叉树结构体
typedef struct BiTNode
{
	int data;
	struct BiTNode* lchild, * rchild;
}BiTNode,*BiTree;

//先序遍历
void preOrder(BiTree T,int &count)
{
	if (T != NULL) {
		count++;	//每遍历一个结点，count有且仅执行一次
		cout << T->data<<" ";
		preOrder(T->lchild,count);
		preOrder(T->rchild,count);
	}
}

//中序遍历
void InOrder(BiTree T)
{
	if (T != NULL) {
		InOrder(T->lchild);
		cout << T->data << " ";
		InOrder(T->rchild);
	}
}

//后序遍历
void postOrder(BiTree T)
{
	if (T != NULL) {
		postOrder(T->lchild);
		postOrder(T->rchild);
		cout << T->data << " ";
	}
}

int main()
{
	BiTNode* root = new BiTNode();
	BiTree ro = root;
	ro->data = 1;
	BiTNode* l = new BiTNode();
	ro->lchild = l;
	l->data = 2;
	BiTNode* lr = new BiTNode();
	l->rchild = lr;
	lr->data = 4;
	BiTNode* lrl = new BiTNode();
	lr->lchild = lrl;
	lrl->data = 6;
	BiTNode* r = new BiTNode();
	ro->rchild = r;
	r->data = 3;
	BiTNode* rr = new BiTNode();
	r->rchild = rr;
	rr->data = 5;
	int count = 0;
	preOrder(ro,count);
	cout << endl;
	InOrder(ro);
	cout << endl;
	postOrder(ro);
	cout << endl;
	cout << count;	//count用于记录结点的数量
	return 0;
}

（2）非递归版（用栈实现）

#include <iostream>
#include <stack>
using namespace std;
//定义二叉树结构体
typedef struct BiTNode
{
	char data;
	struct BiTNode* lchild, * rchild;
}BiTNode, * BiTree;

//前序遍历
void preOrder2(BiTree T) {
	stack<BiTNode*> s;
	BiTree p = T;
	while (p || !s.empty()) {
		if (p) {
			cout << p->data<<" ";//入栈的时候就打印
			s.push(p);
			p = p->lchild;
		}
		else {
			p = s.top();
			s.pop();
			p = p->rchild;
		}
	}
}

//中序遍历
void InOrder2(BiTree T)
{
	stack<BiTNode*> s;
	BiTree p = T;
	while (p  || !s.empty()) {
		//如果p一直不为空，就一直往左走
		if (p) {
			s.push(p);
			p = p->lchild;
		}
		else {	//如果栈为空，p也为空，while是执行不了的
			p = s.top();//记录顶部元素
			s.pop();
			cout << p->data << " ";	//此处打印是因为必须要先把左孩子打印完再打印根结点
			p = p->rchild;
		}
	}
}

//后序遍历
void postOrder2(BiTree T)
{
	stack<BiTNode*> s;
	BiTree  p = T;
	BiTree r = NULL;//记录最近访问过的结点
	while (p != NULL || !s.empty()) {
		if (p) {
			s.push(p);
			p = p->lchild;
		}
		else {
			p = s.top();
			if (p->rchild && p->rchild != r) {//还要验证是否已经访问过p->rchild(E出栈的时候就用到了这个条件)
				p = p->rchild;
			}
			else {
				s.pop();
				cout << p->data << " ";
				r = p;
				p = NULL;
			}
		}
	}
}


int main()
{
	BiTNode* root = new BiTNode();
	BiTree ro = root;
	ro->data = 'A';
	BiTNode* l = new BiTNode();
	ro->lchild = l;
	l->data = 'B';
	BiTNode* ll = new BiTNode();
	l->lchild = ll;
	ll->data = 'D';
	BiTNode* lr = new BiTNode();
	l->rchild = lr;
	lr->data = 'E';
	BiTNode* r = new BiTNode();
	ro->rchild = r;
	r->data = 'C';
	preOrder2(ro);
	cout << endl;
	InOrder2(ro);
	cout << endl;
	postOrder2(ro);
	cout << endl;
	return 0;
}