数据结构课程设计-家谱的实现与设计

//修改{chara[MAX],r[MAX],c;ft*n;printf("请输入要修改人的姓名:");scanf("%s",&a);n=search(root,a);while(n==NULL){printf("此人不存在,请重新输入姓名:\n");scanf("%s",&a);n=search(root,a);}printf("此人存在,请输入新信息:");scanf("%s%c",&r,&c);for(inti=0;i<MAX;i++)n->l.name[i]=r[i];n->l.sex=c;printf("修改成功!\n");}voidDelete()//删除{ft*n,*m;intflag;chard[MAX],a[MAX];printf("请输入要删除人的姓名:");scanf("%s",a);n=search(root,a);while(n==NULL){printf("此人不存在,请重新输入姓名:\n");scanf("%s",&a);n=search(root,a);}printf("\n");printf("此人已找到!\n");printf("\n");m=parent(root,n,&flag);if(flag>0){m->lchild=n->lchild;printf("删除成功!\n");}elseif(flag<0){m->rchild=n->lchild;printf("删除成功!\n");}elseif(flag==0){root->l.generation=NULL;root->l.sex=NULL;strcpy(root->l.name,"");printf("删除成功!\n");}}intmain(){system("color5a");InitTree();for(;;){system("pause");system("cls");