数据结构课程设计家谱c语言,数据结构课程设计 用二叉树实现家谱的相关运算 怎么编？谢谢！...

稍微修改下就应该能用了..

#include <stdio.h>

typedef struct node

{

int tag;

union{struct node *sublist;

char data;

}dd;

struct node *link;

}NODE;

NODE *creat_GL(char **s)

{

NODE *h;

char ch;

ch=*(*s);

(*s)++;

if(ch!='\0')

{

h=(NODE*)malloc(sizeof(NODE));

if(ch=='(')

{

h->tag=1;

h->dd.sublist=creat_GL(s);

}

else

{

h->tag=0;

h->dd.data=ch;

}

}

else

h=NULL;

ch=*(*s);

(*s)++;

if(h!=NULL)

if(ch==',')

h->link =creat_GL(s);

else

h->link=NULL;

return(h);

}

void prn_GL(NODE *p)

{

if(p!=NULL)

{

if(p->tag==1)

{

printf("(");

if(p->dd.sublist ==NULL)

printf(" ");

else

prn_GL(p->dd.sublist );

}

else

printf("%c",p->dd.data);

if(p->tag==1)

printf(")");

if(p->link!=NULL)

{

printf(",");

prn_GL(p->link);

}

}

}

NODE *copy_GL(NODE *p)

{

NODE *q;

if(p==NULL) return(NULL);

q=(NODE *)malloc(sizeof(NODE));

q->tag=p->tag;

if(p->tag)

q->dd.sublist =copy_GL(p->dd.sublist );

else

q->dd.data =p->dd.data;

q->link=copy_GL(p->link);

return(q);

}

int depth(NODE *p)

{

int h,maxdh;

NODE *q;

if(p->tag==0) return(0);

else

if(p->tag==1&&p->dd.sublist==NULL) return 1;

else

{

maxdh=0;

while(p!=NULL)

{

if(p->tag==0) h=0;

else

{q=p->dd.sublist;

h=depth(q);

}

if(h>maxdh)

maxdh=h;

p=p->link;

}

return(maxdh+1);

}

}

int count(NODE *p)

{

int m,n;

if(p==NULL) return(0);

else

{

if(p->tag==0) n=1;

else

n=count(p->dd.sublist);

if(p->link!=NULL)

m=count(p->link);

else m=0;

return(n+m);

}

}

main()

{

NODE *hd,*hc;

char s[100],*p;

p=gets(s);

p=s;

hd=creat_GL(&p);

hc=copy_GL(hd);

printf("\ncopy after:");

prn_GL(hc);

printf("\ndepth=%d ",depth(hc));

printf("\ncount=%d",count(hc));

getch();

}

◆◆

评论读取中....

请登录后再发表评论!

◆◆

修改失败，请稍后尝试