高校最低录取分数线的查询源代码.doc

高校最低录取分数线的查询 问题描述：现要开发一个开放式的高校本科招生最低录取分数线的查询系统，供师生和学生家长等查询，高校自愿放入该校的信息，可能随时有高校加入。功能要求：要求实现的查询功能有：(1)??? 查询等于用户给定分数的高校；(2)??? 查询大于(或小于)用户给定分数的高校；????(3)??? 查询最低录取分数线在用户给定的分数段中的高校。（注：为了省下打字的工夫，函数功能相似的都压缩到了一起，所以个别函数会显得烦琐！）/*************** 头文件 ***************/#includestdio.h#includewindows.h#define OK 1#define ERROR 0typedef struct node?? //学校名称{char SchoolName[10],SchoolNum[5];struct node *next;}SchoolList;typedef struct?????????? //录取分数对应的学校{int PassMark;SchoolList A;}PassMark_Info;typedef struct Node???? //二叉树节点定义{PassMark_Info data;struct Node *lchild,*rchild;}tree,*Qtree;void xy(int x, int y){ COORD c; c.X=x-1; c.Y=y-1; SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE),c);}/************** 保存文件 ******************/void InOrder_(Qtree t,FILE *fp){if(t!=NULL){?? InOrder_(t-lchild,fp);??? fprintf(fp,%s\t%s\t%d\t,t-data.A.SchoolNum,t-data.A.SchoolName,t-data.PassMark);?? InOrder_(t-rchild,fp);}}int SaveFiles(Qtree t){FILE *fp;if((fp=fopen(passmark,w))==NULL){?? printf(\tERROR...);?? return 0;}else InOrder_(t,fp);fclose(fp);return OK;}/*************************************/void Print(Qtree t)//输出{SchoolList *p=(t-data.A);while(p){?? printf(%10s\t%10s\t%10d\n,p-SchoolNum,p-SchoolName,t-data.PassMark);?? p=p-next;}}void InOrder(Qtree t,int PassMark,int PassMark_,int k){if(t!=NULL){?? InOrder(t-lchild,PassMark,PassMark_,k);?? {??? if((k==1t-data.PassMark=PassMark)||(k==2t-data.PassMark=PassMark)||(k==0PassMark=t-data.PassMarkt-data.PassMark=PassMark_))???? //printf(%10s\t%10s\t%10d\n,t-data.A.SchoolNum,t-data.A.SchoolName,t-data.PassMark);???? Print(t);?? }?? InOrder(t-rchild,PassMark,PassMark_,k);}}tree* Search(Qtree t,int PassMark){if((t==NULL)||(t-data.PassMark==PassMark))?? return t;else if(t-data.PassMarkPassMark)?? return Search(t-lchild,PassMark);else return Search(t-rchild,PassMark);}tree* t_Insert(Qtree *t,FILE *fp){tree *p,*pre,*q;q=(tree *)malloc(sizeof(tree));if(q!=NULL){