二叉树遍历

 遍历如图所示拓扑结构的二叉树

1.先序遍历

2.中序遍历

3.后序遍历

如下图所示完整代码：

#include<stdio.h>
#include<stdlib.h>
typedef struct TreeNode{
	int value;
	TreeNode* leftchild;
	TreeNode* rightchild;
	bool isEmpty;
}BiTNode,*BiTree;

void visit(BiTree T){
	printf("%d\n",T->value);
}

//先序遍历
void PreOrder(BiTree T){
	if(T->isEmpty==false){
		visit(T);
		PreOrder(T->leftchild);
		PreOrder(T->rightchild);
	}
}

//中序遍历
void InOrder(BiTree T){
	if(T->isEmpty==false){
		InOrder(T->leftchild);
		visit(T);
		InOrder(T->rightchild);
	}
}

//后序遍历
void PostOrder(BiTree T){
	if(T->isEmpty==false){
		PostOrder(T->leftchild);
		PostOrder(T->rightchild);
		visit(T);
	}
}

int main(){
	BiTree p = NULL; //初始化一颗空树
	p = (BiTNode*)malloc(sizeof(BiTNode));
	p->value = 20;
	BiTNode* leftchild = (BiTNode*)malloc(sizeof(BiTNode));
	BiTNode* rightchild = (BiTNode*)malloc(sizeof(BiTNode));
	p->leftchild =leftchild;
	p->rightchild =rightchild;
	leftchild->value = 25;
	rightchild->value = 70;
	BiTNode* leftchild2 = (BiTNode*)malloc(sizeof(BiTNode));
	leftchild->rightchild = leftchild2;
	leftchild2->value = 75;
	
	p->isEmpty=false;
	p->leftchild->isEmpty=false;
	p->rightchild->isEmpty=false;	
	p->leftchild->rightchild->isEmpty=false;
	
	//终止递归 （用的是devc++编译器  需要终止一下递归不然死循环） 
	BiTNode* p1 = (BiTNode*)malloc(sizeof(BiTNode));
	BiTNode* p2 = (BiTNode*)malloc(sizeof(BiTNode));
	BiTNode* p3 = (BiTNode*)malloc(sizeof(BiTNode));
	BiTNode* p4 = (BiTNode*)malloc(sizeof(BiTNode));
	BiTNode* p5 = (BiTNode*)malloc(sizeof(BiTNode));
	p1->isEmpty=true;
	p2->isEmpty=true;
	p3->isEmpty=true;
	p4->isEmpty=true;
	p5->isEmpty=true;
	leftchild->leftchild = p1;
	rightchild->leftchild = p2;
	rightchild->rightchild = p3;
	leftchild->rightchild->leftchild = p4;
	leftchild->rightchild->rightchild = p5;

	//PreOrder(p);   //先序遍历 
	//InOrder(p);	//中序遍历 
	PostOrder(p);	//后序遍历 
}