bitree.txt

二叉树有三种遍历方法

#include<stdio.h>
#include<malloc.h>
typedef struct tree{
	struct tree *lchild;
	struct tree *rchild;
	char data;
}*Bitree,Binode;

Bitree CreateBitree(Bitree &T){
	  char ch;
	  scanf("%c",&ch);
	  getchar();
	  if(ch==' ')   T=NULL;
	  else{
		  T=(Bitree)malloc(sizeof(Binode));
		  T->data=ch;
		  CreateBitree(T->lchild);
		  CreateBitree(T->rchild);
	  }
	return T;
}//创建二插树

int Height(Bitree T){
	int m,n;
	if(T==NULL)    return 0;
	else{
		m=Height(T->lchild);
		n=Height(T->rchild);
		return(m>n? m+1:n+1);
	}
}//求二插树高度

void Print(Bitree T){
	if(T!=NULL){
		printf("%c ",T->data);
		Print(T->lchild);
		Print(T->rchild);
	}
}//输出二插树

void main(){
	int h;
	Bitree T;
	printf("创建二插树！输入数据：\n");
	T=CreateBitree(T);
	printf("输出所创建的二插树：\n");
	Print(T);
	h=Height(T);
	printf("二插树深度为：\n");
	printf("%d\n",h);
}