c语言个人通讯录（功能未全部完成）

#include <stdio.h>#include <string.h>#include <stdlib.h>#define N 20void initlist(struct Node **phead);void printlist(struct Node **phead);void insertlist(struct Node **phead);void searchList(struct Node **phead);void deletelist(struct Node **phead);void inserttree(struct TreeNode **root,struct Node **phead,int ch);typedef struct Node{char name[N];char phonenumber[N];char kinds[N];char birthday[N];struct Node *next;}Node;//////////////////////////////////////#define MAXLEN 100typedef struct TreeNode{    struct Node *list;struct TreeNode *left;struct TreeNode *right;}TreeNode; void inserttree(struct TreeNode **root,struct Node **phead,int ch){struct TreeNode *hroot = *root;struct Node *p = *phead;while(p != NULL){printf("name == %s\n",p->name);if(hroot == NULL){hroot = (struct TreeNode*)malloc(sizeof(struct TreeNode));hroot->list = p;hroot->left = NULL;hroot->right = NULL;*root = hroot;}else{struct TreeNode *temp = hroot;while(1){if(ch == 1){if(strcmp(temp->list->name,p->name) > 0){printf(">\n");if(temp->left == NULL)break;temp = temp->left;}else if(strcmp(temp->list->name,p->name) <= 0){printf("<\n");if(temp->right == NULL)break;temp = temp->right;}elsebreak;}if(ch == 2){if(strcmp(temp->list->phonenumber,p->phonenumber) > 0){printf(">\n");if(temp->left == NULL)break;temp = temp->left;}else if(strcmp(temp->list->phonenumber,p->phonenumber) <= 0){printf("<\n");if(temp->right == NULL)break;temp = temp->right;}elsebreak;}if(ch == 3){if(strcmp(temp->list->kinds,p->kinds) > 0){printf(">\n");if(temp->left == NULL)break;temp = temp->left;}else if(strcmp(temp->list->kinds,p->kinds) <= 0){printf("<\n");if(temp->right == NULL)break;temp = temp->right;}elsebreak;}if(ch == 4){if(strcmp(temp->list->birthday,p->birthday) > 0){printf(">\n");if(temp->left == NULL)break;temp = temp->left;}else if(strcmp(temp->list->birthday,p->birthday) <= 0){printf("<\n");if(temp->right == NULL)break;temp = temp->right;}elsebreak;}}struct TreeNode *newtree=(struct TreeNode*)malloc(sizeof(struct TreeNode));newtree->list = p;newtree->left = NULL;newtree->right = NULL;if(ch == 1){if(strcmp(temp->list->name,p->name) > 0){temp->left = newtree;}else if(strcmp(temp->list->name,p->name) <= 0){temp->right = newtree;}}if(ch == 2){if(strcmp(temp->list->phonenumber,p->phonenumber) > 0){temp->left = newtree;}else if(strcmp(temp->list->phonenumber,p->phonenumber) <= 0){temp->right = newtree;}}if(ch == 3){if(strcmp(temp->list->kinds,p->kinds) > 0){temp->left = newtree;}else if(strcmp(temp->list->kinds,p->kinds) <= 0){temp->right = newtree;}}if(ch == 4){if(strcmp(temp->list->birthday,p->birthday) > 0){temp->left = newtree;}else if(strcmp(temp->list->birthday,p->birthday) <= 0){temp->right = newtree;}}}p = p->next;}}////////////////////////////////////////////////////////////////////////////void deletelist(struct Node **phead){char name[N];struct Node *h = *phead;struct Node *p = *phead;struct Node *n = h->next;printf("ﾇ・菠・靨ｪﾉｾｳｵﾄﾐﾕﾃ・｣ｺ");scanf("%s",name);while(p->next != NULL){if(strcmp(name,p->name) == 0){struct Node *temp1 = h;p = h = h->next;n = n->next;*phead = h;free(temp1);break;}else if(strcmp(name,n->name) == 0 && strcmp(name,h->name) != 0){struct Node *temp2 = n;n = n->next;p->next = n;free(temp2);break;}p = p->next;n = p->next;}printf("ﾉｾｳｳﾉｹｦ\n");}void insertlist(struct Node **phead){struct Node *p = NULL;struct Node *temp = *phead;FILE *fp = NULL;p = (struct Node *)malloc(sizeof(struct Node));memset(p,0,sizeof(struct Node));printf("ﾇ・菠・ﾂﾔｪﾏｵﾈﾋﾐﾅﾏ｢\n");printf("ﾐﾕﾃ・｣ｺ");scanf("%s",p->name);printf("ｵ扈ｰ ｣ｺ");scanf("%s",p->phonenumber);printf("ﾗ魍・｣ｺ");scanf("%s",p->kinds);printf("ﾉ抦ﾕ ｣ｺ");scanf("%s",p->birthday);while(temp->next != NULL){temp = temp->next;}temp->next = p;fp = fopen("data.h","a");if(fp == NULL){printf("fopen error\n");}fprintf(fp,"%s %s %s %s",p->name,p->phonenumber,p->kinds,p->birthday);fclose(fp);printf("ｳﾉｹｦ\n");}void searchList(struct Node **phead){struct Node *p = *phead;char ch;char name[N];printf("ﾇ・菠・靨ｪｲ鰉ｯｵﾄﾁｪﾏｵﾈﾋﾐﾕﾃ犾n");scanf("%s",name);while(strcmp(p->name,name) != 0 && p->next != NULL){p = p->next;}if(p != NULL){printf("ﾐﾕﾃ・｣ｺ");printf("%s\n",p->name);printf("ｵ扈ｰ ｣ｺ");printf("%s\n",p->phonenumber);printf("ﾗ魍・｣ｺ");printf("%s\n",p->kinds);printf("ﾉ抦ﾕ ｣ｺ");printf("%s\n",p->birthday);printf("\n");printf("ﾊﾇｷﾐﾐﾞｸﾄ Y/N\n");scanf("%c",&ch);if(ch == 'Y'){printf("ﾐﾕﾃ鋗ﾞｸﾄ｣ｨ%s｣ｩ ｣ｺ",p->name);scanf("%s",p->name);printf("ｵ扈ｰﾐﾞｸﾄ (%s)｣ｺ",p->phonenumber);scanf("%s",p->phonenumber);printf("ﾗ魍ﾞｸﾄ (%s)｣ｺ",p->kinds);scanf("%s",p->kinds);printf("ﾉ抦ﾕﾐﾞｸﾄ (%s)｣ｺ",p->birthday);scanf("%s",p->birthday);}}else{printf("ﾃｻﾓﾐｴﾋﾈﾋﾐﾅﾏ｢\n");}}void initlist(struct Node **phead){struct Node *p = NULL;struct Node *q = NULL;struct Node *temp = *phead;FILE *fp = NULL;char name[N];char phonenumber[N];char kinds[N];char birthday[N];fp = fopen("data.h","r");if(fp == NULL){fp = fopen("data.h","w");fclose(fp);}p = q = (struct Node *)malloc(sizeof(struct Node));if(p == NULL || q == NULL){printf("malloc failed\n");exit(0);}memset(q,0,sizeof(struct Node));fscanf(fp,"%s %s %s %s",name,phonenumber,kinds,birthday);strcpy(p->name,name);strcpy(p->phonenumber,phonenumber);strcpy(p->kinds,kinds);strcpy(p->birthday,birthday);p->next = NULL;while(!feof(fp)){if(*phead != NULL){fscanf(fp,"%s %s %s %s",name,phonenumber,kinds,birthday);p = (struct Node *)malloc(sizeof(struct Node));if(p == NULL){printf("malloc failed\n");exit(0);}memset(p,0,sizeof(struct Node));strcpy(p->name,name);strcpy(p->phonenumber,phonenumber);strcpy(p->kinds,kinds);strcpy(p->birthday,birthday);p->next = NULL;}if(*phead == NULL){*phead = p;}else{q->next = p;q = p;}}fclose(fp);}void printlist(struct Node **phead){struct Node *p = *phead;if(NULL == p)       {        printf("ﾍｨﾐﾅﾂｼﾎｪｿﾕ\n");    }    else    {printf("ﾍｨﾐﾅﾂｼﾐﾅﾏ｢ﾎｪ｣ｺ \n");while(p != NULL)        {printf("ﾐﾕﾃ・｣ｺ");printf("%s\n",p->name);printf("ｵ扈ｰ ｣ｺ");printf("%s\n",p->phonenumber);printf("ﾗ魍・｣ｺ");printf("%s\n",p->kinds);printf("ﾉ抦ﾕ ｣ｺ");printf("%s\n",p->birthday);            p = p->next;printf("\n");        }        printf("\n");    }}void print(struct TreeNode *root){if(root == NULL)return;else{print(root->left);printf("ﾐﾕﾃ・｣ｺ");printf("%s\n",root->list->name);printf("ｵ扈ｰ ｣ｺ");printf("%s\n",root->list->phonenumber);printf("ﾗ魍・｣ｺ");printf("%s\n",root->list->kinds);printf("ﾉ抦ﾕ ｣ｺ");printf("%s\n",root->list->birthday);printf("\n");printf("********************************************\n");print(root->right);return;}}int main(){struct Node *head = NULL;struct TreeNode *root = NULL;initlist(&head);printlist(&head);//insertlist(&head);//printlist(&head);//inserttree(&root,&head,3);//searchList(&head);deletelist(&head);printlist(&head);//print(root);return 0;}