代码小生

#include<iostream>using namespace std;#define max 10typedef struct{ int num,score1,score2;//学号,数据结构成绩，程序设计成绩 string name;}one;typedef struct{ one information[max+1];//最大存储学生信息个数 int sum;//学生总数...等信息}student;//学生总的void out...

#include<iostream>using namespace std;#define max 32867#define mvm 100typedef int elemtype;int visit[mvm];typedef struct xx{ elemtype vexs[mvm]; int arcs[mvm][mvm]; int vexnum, arcnum;}amgraph;typedef struct zz{ elemtyp...

#include<iostream>using namespace std;typedef struct bitnode{ char ch; bitnode* lchild, * rchild;}tree, * bitree;void createtree(bitree& t){ char m; cin >> m; if (m == '#')//输入#则是空 { t = NULL; }...

#include<iostream>using namespace std;#define maxsize 7typedef struct{ string name; int num;}elemtype;typedef struct quee{ elemtype * people; int front; int rear;}quee;void initialquee(quee& q){ q.people = ne...

#include<iostream>using namespace std;# define max 10typedef struct stack{ int* base; int* top; int stacksize;}stack;void innitialstack(stack& s){ s.base = s.top = new int[max+1]; s.stacksize = max; if (s.base) ...

#include<iostream>#include<stdlib.h>using namespace std;typedef int elemtype;typedef int status;typedef struct node{ elemtype elem; node* next;}lnode ,*linklist;void menu1();//申明链表菜单函数status initiallist(linklist& l){...

#include<iostream>#include<stdlib.h>using namespace std;typedef int elemtype;typedef int status;#define maxsize 15typedef struct{ elemtype* elem; int length;}sqlist;void menu();//申明顺序表菜单函数status initiallist(sqlist& l)...