用二叉树,实现建立词典,查找,插入,删除单词.doc

,.txt1617#include #include #include #include #define MAXWORD 100typedef struct tnodechar *word;int count;struct tnode *left;struct tnode *right;/ tnode(char *s, int w, tnode *p, tnode *q)/ / *tnodeptr;struct tnode *addtree(struct tnode *, char *);void deltree(struct tnode *, char *);void treeprint(struct tnode*, FILE *fp, int n, int &m);void showMenu();void main()int N, k; FILE *fp;struct tnode *root;char wordMAXWORD, txt25;root=NULL; while (1)showMenu();scanf(%d, &N);switch(N)case 1:printf( 0 :n);while (scanf(%s, word)!=EOF)if(word0=0) break;if(isalpha(word0)root=addtree(root, word);printf(n);break;case 2:if(root=NULL) printf(NULLn); break;printf(n);treeprint(root, fp, 0,k = 1);break;case 3:printf(n);scanf(%s, word);deltree(root, word);break;case 4:printf(: );scanf(%s, txt);strcat(txt, .txt);fp=fopen(txt, w);if(fp=NULL) printf(!); break;treeprint(root, fp, 1, k = 1);fclose(fp);printf(%s n, txt);break;case 0:return ;default:printf(!);break;return ;struct tnode* talloc();char *strdup(char*);struct tnode *addtree(struct tnode *p, char *w)int cond;if (p=NULL)p=talloc();p-word=strdup(w);p-count=1;p-left=p-right=NULL;else if(cond=strcmp(w, p-word)=0)p-count+;else if (condleft=addtree(p-left, w);elsep-right=addtree(p-right, w);return p;/* 4* 1. * 2. * 3. * 4. * a. * * b. */void deltree(struct tnode *p, char *w)int co, t=0;struct tnode *q=NULL, *r=NULL;while (p!=NULL & (co=strcmp(w, p-word)!=0)if(co left; t =1;else q =p; p=p-right; t =0;if(p=NULL)printf(n);else if (p-left=NULL & p-right=NULL) /if(t=1)q-left= NULL;else q-right=NULL;else if(p-left & p-right=NULL) /if(t=1) q-left=p-left;else q-right =p-left;else if(p-left=NULL & p-right) /if(t=1)q-left=p-right;else q-right=p-right;else / r=p-left;while(r-right)r =r-right;r-right =p-right;if(t=1)q-left = r;else q-right = r;printf(%s n, w);return ;/-/print/-void treeprint(struct tnode* p,FILE *fp, int n, int &m)if(p!=NULL)treeprint(p-left, fp, n,m);if(n)fprintf(fp, %-4d%-4d%sn,m+,p-count,p-word);else printf(%-4d%-4d%sn,m+,p-count,p-word);treeprint(p-right, fp, n,m);struct tnode *talloc()return (struct tnode*)malloc(sizeof(struct tnode);char *strdup(char*s)char *p;p=(char*)malloc(strlen(s)+1);if(p!=NULL) strcpy(p, s);return p;void showMenu()printf(n t n 1. n 2. n 3. n 4. n 0. n);/*struct Node int id; Node *left,*right;class IDTree Node *root; void Show(Node*& t) if(t=NULL) return; Show(t-left); coutidright); void Add(Node*& t,int n) if(t=NULL) t=new Node; t-id=n; t-left=t-right=NULL; else if(nid) Add(t-left,n); else Add(t-right,n); int Count(Node*t) int i=1; coutileft); i+=Count(t-right); return i; else return 0; public: IDTree() root=NULL; void AddID(int n) Add(root,n); void ShowID() Show(root); int CountID() return Count(root); bool Find(int n) Node *t=root; while(t) if(n=t-id) return true; if(nt-id) t=t-right; if(nid) t=t-left; return false;void Removeint n)*/*void Remove(Node *BT,int x) Node *p=*BT,*q,*r,*t; q=NULL; while(p!=NULL&p-data!=x) if(xdata) q=p; p=p-left; else q=p; p=p-right; if(p=NULL) coutleft=NULL)/ if(q=NULL)/ t=p-right; else if(q-left=p) q-left=p-right; else q-r