遍历二叉树（递归）

遍历二叉树（递归）

#include<stdio.h>
#include<stdlib.h>   //动态内存分配

#define OK 1;
#define ERROR 0;
typedef char TElemType;
typedef int Status;

typedef struct BiTNode{
	TElemType data;							//
	struct BiTNode *lchild,*rchild;			//左右孩子指针

}BiTNode,*BiTree;


//创建二叉树
Status CreateBiTree(BiTree &T){
	
	char ch;
	scanf("%c",&ch);
	if(ch=='#'){
		T=NULL;
	}else{
		T = (BiTree )malloc (sizeof(struct BiTNode ));
		T->data = ch;
		CreateBiTree (T->lchild );
		CreateBiTree (T->rchild );
	}


	return OK;
}

//先序遍历
Status PreOrderTraverse(BiTree T,Status (*Visit)(TElemType e)){

	if(T){
		if(Visit (T->data ))
			if(PreOrderTraverse (T->lchild ,Visit ))
				if(PreOrderTraverse (T->rchild ,Visit ))
					return OK;

		return ERROR;
	}else
		return OK;

}

//中序遍历
Status InOrderTraverse(BiTree T,Status (*visit)(TElemType e)){

	if(T){
		if(InOrderTraverse (T->lchild ,visit ))
			if(visit (T->data ))
				if(InOrderTraverse(T->rchild ,visit ))
					return OK;

		return ERROR;
	}else
		return OK;
}

//后根遍历
Status PostOrderTraverse(BiTree T,Status (*Visit)(TElemType e)){

	if(T){
		if(PostOrderTraverse (T->lchild ,Visit))
			if(PostOrderTraverse (T->rchild ,Visit))
				if(Visit (T->data))
					return OK;
		return ERROR;
	}else
		return OK;
	
}

Status Visit(TElemType e){
	printf("%c",e);
	return OK;
}

Status main(){
	
	BiTree T;
	
	CreateBiTree (T);
	printf("\n先序遍历二叉树\n");
	PreOrderTraverse (T,Visit);
	printf("\n中序遍历二叉树\n");
	InOrderTraverse(T,Visit);
	printf("\n后序遍历二叉树\n");
	PostOrderTraverse(T,Visit);

	printf("\n");
	return OK;
}