二叉树的打印.doc

#include#include#include#include#include#define NULL 0 typedef struct BiTNodechar data; struct BiTNode *lchild,*rchild; BiTNode,*BiTree; BiTree Create(BiTree T) char ch; ch=getchar(); if(ch=#) T=NULL; else if(!(T=(BiTNode *)malloc(sizeof(BiTNode) printf(Error!); T-data=ch; T-lchild=Create(T-lchild); T-rchild=Create(T-rchild); return T; void xianxu(BiTree T) if(T)printf(%c,T-data); xianxu(T-lchild);xianxu(T-rchild); void zhongxu(BiTree T) if(T) zhongxu(T-lchild); printf(%c,T-data); zhongxu(T-rchild); void houxu(BiTree T) if(T) houxu(T-lchild); houxu(T-rchild); printf(%c,T-data); int Sumleaf(BiTree T) int sum=0,m,n; if(T) if(!T-lchild)&(!T-rchild) sum+; m=Sumleaf(T-lchild); sum+=m; n=Sumleaf(T-rchild); sum+=n; return sum; int Depth(BiTree T) int dep=0,depl,depr; if(!T) dep=0; else depl=Depth(T-lchild); depr=Depth(T-rchild); dep=1+(depldepr?depl:depr); return dep; void Paint(BiTree T,int x,int y,int g) char c2; int you=0,zuo=0; if(T) setcolor(WHITE); circle(x,y,10); c0=T-data; c1=0; outtextxy(x,y,c); if(T-lchild!=NULL) if(xg) zuo=(x-g)/2+g; if(xrchild!=NULL) you=2*x-zuo; line(x-1,y,you,y+40); Paint(T-lchild,zuo,y+40,x); Paint(T-rchild,you,y+40,x); returnvoid menudisplay() printf(*MENU*n); printf( 1.JianLi 2.DaYin 3.X Xu 4.Z Xu 5.H Xu 6.S Du 7.YZ Shu 8.Menu 9.X Hui 0.Quitn); printf(*MENU*n); void destroytree(BiTree T) if(T=NULL) return; else if(T-lchild=NULL&T-rchild=NULL) free(T); return; else destroytree(T-lchild); destroytree(T-rchild); free(T); return; main() BiTree T; char c; int flag=0; int x,y,g,sum,dep; int gdriver,gmode; x=240;y=20;g=0; gdriver=DETECT; menudisplay(); c=getchar(); fflush(stdin); while(c!=0) switch(c) case 1: printf(Xian xu shu ru er cha shu de zhi!n); printf(# Biao shi kong!n); T=Create(T); flag=1; printf(OKn); break; case 2: if(flag=0) printf(Shu Wu.n); else initgraph(&gdriver,&gmode,D:TC); setbkcolor(BLUE); cleardevice(); Paint(T,x,y,g); getch(); closegraph(); break; case 3: if(flag=0) printf(Shu Wu.n); else xianxu(T); printf(n) ; break; case 4: if(flag=0) printf(Shu Wu.n); else zhongxu(T); printf(n) ; break; case 5: if(flag=0) printf(Shu Wu.n); else houxu(T); printf(n) ; break; case 6: if(flag=0) printf(Shu Wu.n); else dep=Depth(T); printf(%d,dep); printf(n) ; break; case 7: if(flag=0) printf(Shu Wu.n); else sum=Sumleaf(T); printf(%d,sum); printf(n) ; break; case 8: menudisplay(); break; case 9: if(flag=0) printf(Shu Wu.n); else