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

高校最低录取分数线的查询 问题描述： 现要开发一个开放式的高校本科招生最低录取分数线的查询系统，供师生和学生家长等查询，高校自愿放入该校的信息，可能随时有高校加入。 功能要求： 要求实现的查询功能有： (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;}Btree,*QBtree;void xy(int x, int y){ COORD c; c.X=x-1; c.Y=y-1; SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE),c);}/************** 保存文件 ******************/void InOrder_(QBtree bt,FILE *fp){if(bt!=NULL){?? InOrder_(bt-lchild,fp);??? fprintf(fp,%s\t%s\t%d\t,bt-data.A.SchoolNum,bt-data.A.SchoolName,bt-data.PassMark);?? InOrder_(bt-rchild,fp);}}int SaveFiles(QBtree bt){FILE *fp;if((fp=fopen(passmark,wb))==NULL){?? printf(\tERROR...);?? return 0;}else InOrder_(bt,fp);fclose(fp);return OK;}/*************************************/void Print(QBtree bt)//输出{SchoolList *p=(bt-data.A);while(p){?? printf(%10s\t%10s\t%10d\n,p-SchoolNum,p-SchoolName,bt-data.PassMark);?? p=p-next;}} void InOrder(QBtree bt,int PassMark,int PassMark_,int k){if(bt!=NULL){?? InOrder(bt-lchild,PassMark,PassMark_,k);?? {??? if((k==1bt-data.PassMark=PassMark)||(k==2bt-data.PassMark=PassMark)||(k==0PassMark=bt-data.PassMarkbt-data.PassMark=PassMark_))???? //printf(%10s\t%10s\t%10d\n,bt-data.A.SchoolNum,bt-data.A.SchoolName,bt-data.PassMark);???? Print(bt);?? }?? InOrder(bt-rchild,PassMark,PassMark_,k);}}Btree* Search(QBtree bt,int PassMark){if((bt==NULL)||(bt-data.PassMark==PassMark))?? return bt;else if(bt-data.PassMarkPassMark)?? return Search(bt-lchild,PassMark);else return Search(bt-rchild,PassMark);}Btree* Bt_Insert(QBtree *bt,FILE *fp){Btree *p,