VC c语言 各种程序代码.docx

Vc实现二叉树遍历，学生成绩管理系统，调用系统程序，对学生成绩冒泡排序，选择排序等代码，能运行二叉树#include stdafx.h#include struct BinTreeNode char data;struct BinTreeNode *left,*right;class BinTreepublic:BinTreeNode *root;void BinTree:PreOrder(BinTreeNode *t)if(t!=NULL&t-data!=0)coutdataleft);PreOrder(t-right);void BinTree:InOrder(BinTreeNode *t)if(t!=NULL&t-data!=0)InOrder(t-left);coutdataright);void BinTree:PostOrder(BinTreeNode *t)if(t!=NULL&t-data!=0)PostOrder(t-left);PostOrder(t-right);coutdata ;int main()BinTree k;char ch30;coutch;int i=0;int j=0;BinTreeNode *s ,*root;BinTreeNode *q100;while (chi!=0)if (chi=#) i+;else s=new BinTreeNode;s-data=chi;s-left=NULL;s-right=NULL;j=i+1;if (i=0)root=s;elseif (qj/2!=NULL)if (j%2=0) qj/2-left=s;else qj/2-right=s;qj=s;i+;coutFine!endl;cout先根:endl;k.PreOrder(root);coutendl中根:endl;k.InOrder(root);coutendl后根:endl;k.PostOrder(root);coutendl;return 0;二叉树生成与遍历二叉树生成与遍历完整代码：/ Exec.cpp : Defines the entry point for the console application./#include stdafx.h#include struct BinTreeNodepublic:char data;BinTreeNode *left,*right;void pre(BinTreeNode *ppp)if(ppp!=NULL&ppp-data!=0)coutdataleft);pre(ppp-right);void mid(BinTreeNode *ppp)if(ppp!=NULL&ppp-data!=0)mid(ppp-left);coutdataright);void post(BinTreeNode *ppp)if(ppp!=NULL&ppp-data!=0)post(ppp-left);post(ppp-right);coutdata ;int main(int argc, char* argv)printf(Hello World!n);char ch100;coutch;BinTreeNode *q100;BinTreeNode *s,*root;for(int j=0;jdata=chi;s-left=NULL;s-right=NULL;j=i+1;if(i=0) root=s;elseif (qj/2!=NULL)if(j%2=0) qj/2-left=s;else qj/2-right=s;qj=s;i+;coutFine!endl;cout先根:endl;pre(root);coutendl中根:endl;mid(root);coutendl后根:endl;post(root);coutendl;return 0;学生成绩管理系统/ T2.cpp : Defines the entry point for the console application./#include stdafx.h#include #include struct Studentchar id10;char name10;char sex10;char grade10;char tel20;char age10;class SeqListpublic:Student data20;int length;SeqList() length=0;bool IsListEmpty()return length=0;void ListDelete(char ID)int j=0;for(int i=0;ilength;i+)if(strcmp(datai.id,ID)=0)j=i+1;if(j=0) cout没有该学生的信息！endl;elsefor(int k=j;k=0;i-)datai+1=datai;data0=x;length+;void Showall()for(int d=0;dlength;d+)cout id datad.id name sex datad.sex grade datad.grade tel datad.tel age datad.ageendl; int main(int argc, char* argv)int n;printf(Hello World!n);SeqList Q;while(n!=0)cout1信息浏览endl;cout2插入信息endl;cout3删除信息endl;cout0退出程序n;switch(n)case 1:cout数据库中没有信息endl; Q.Showall();break;case 2: cout数据库中的信息endl; Student x; coutID=x.id; coutNAME=; coutSEX=x.sex; coutGRADE=x.grade; coutTEL=x.tel; coutAGE=x.age; Q.ListInsert(x); break;case 3: char Y10; coutID=Y;Q.ListDelete(Y); break; Q.ListDelete(Y);break;return 0;学生管理系统（单链表）学生管理系统（单链表）完整代码#include stdafx.h#include #include struct Studentchar id10;char name10;char sex10;char grade 10;struct LNodeStudent stu;Student data;LNode*next;class LinkListpublic: LNode*current,*previous;LNode*head;int length;LinkList()head= new LNode();head-next=NULL;length=0;bool IsListEmpty()return length=0;void LinkList:InsertList(Student x)LNode*s=new LNode();s-stu=x;s-next=head-next;head-next=s;length+;void LinkList:DeleteList(char ID) previous=head;current=head-next;for(int i=0;istu.id,ID)=0)previous-next=current-next;length=length-1;return;previous=current;current=current-next;coutID=IDnext;for(int i=0;ilength;i+)coutID=stu.idtNAME=tSEX=stu.sextGRADE=stu.gradenext;int main(int argc, char* argv) LinkList k;int x=1;while(x!=0)printf(请输入以下选项:n);printf(1:信息浏览n);printf(2:插入信息n);printf(3:删除信息n);printf(0:退出程序n);cinx;switch(x)case 1:k.ShowAll();break;case 2:Student N;coutID=N.id;coutNAME=N.name;coutSEX=N.sex;coutGRADE=N.grade;k.InsertList(N);break;case 3:char delID10;cout请输入想要删除数据项的ID号码delID;k.DeleteList(delID);break;case 0:break;return 0;调用系统程序/ 实验五.cpp : Defines the entry point for the console application./#include stdafx.h#include #include void child_process(char command)PROCESS_INFORMATION piProcInfo;STARTUPINFO Info;Info.cb=sizeof(STARTUPINFO);Info.lpDesktop=NULL;Info.lpTitle=NULL;Info.cbReserved2=0;BOOL bSuccess=CreateProcess(NULL,command,NULL,NULL,false,NULL,NULL,NULL,&Info,&piProcInfo);if(! bSuccess)cout命令错误endl;e