abinarytree.txt

求二叉树树高

#include<stdio.h>
#include<malloc.h>
typedef struct node
{
char data;   /*此例中二叉树的结点采用字符类型*/
struct node *lchild,*rchild;
}NODE;
int count;
NODE *crt_bt_pre()   /*按先序遍历序列创建二叉树的二叉链表*/
{
NODE *bt;
char ch;
printf("\n\t\t\t");
scanf("%c",&ch);
getchar();
if(ch==' ') bt=NULL;
else
{
bt=(NODE *)malloc(sizeof(NODE));
bt->data=ch;
printf("\n\t\t\tqingshuru%cjiediandezuohaizi: ",bt->data);
bt->lchild=crt_bt_pre();
printf("\n\t\t\tqingshuru%cjiediandeyouhaizi: ",bt->data);
bt->rchild=crt_bt_pre();
}
return(bt);
}
int TreeDepth(NODE *bt)  /*求二叉树的深度*/
{
int ldep,rdep;
if(bt==NULL)
return 0;
else
{
ldep=TreeDepth(bt->lchild);
rdep=TreeDepth(bt->rchild);
if(ldep>rdep)
return(ldep+1);
else
return(rdep+1);
}
}
main()
{
NODE *bt;
int x;
x=TreeDepth(bt); /*调用求二叉树深度的函数*/
printf("\n\t\t\tgaierchashudeshenduwei%d",x);
}



void root(char *pre,char *mid) 
{ 
char *p; 

if(!*mid) 
return; 
p=strchr(mid,*pre); 
*p=0x00; 
root(pre+1,mid); 
root(pre+(p-mid+1),p+1); 

printf("%c",*pre); 
}