ヾ(^∀^)ﾉ

数据结构链表实现学生成绩管理系统//consts.h#include<string.h>#include<malloc.h>#include<stdlib.h>#include<stdio.h>#include<limits.h>#include<io.h>#include<math.h>#include<process.h>#define TRUR 1#define FALSE 0

//seqstack.h#include<string.h>#include<malloc.h>#include<limits.h>#include<stdio.h>#include<io.h>#include<math.h>#include<process.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR -1#

//linkstack.h#include<string.h>#include<malloc.h>#include<limits.h>#include<stdio.h>#include<io.h>#include<math.h>#include<process.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR -1#

//seqstack.h#include<string.h>#include<malloc.h>#include<limits.h>#include<stdio.h>#include<io.h>#include<math.h>#include<process.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR -1#d

LinkStack * IntConverDToB(int t, LinkStack *s)/*十进制到二进制整数部分转换函数*/{ while(t != 0) { s = LStackPush(s,t % 2); t /= 2; } return s;}void DecConverDToB(float f,LinkQueue *

*1.链队列* 存储结构：typedef struct LQNode{ DataType info; struct LQNode *next;}LQNode;typedef struct{ struct LQNode *front; struct LQNode *rear;}LinkQueue;基本操作的实现：//创建空队列LinkQueue *LQue

数据结构顺序表//consts.h#include<string.h>#include<malloc.h>#include<stdlib.h>#include<stdio.h>#include<limits.h>#include<io.h>#include<math.h>#include<process.h>#define TRUR 1#define FALSE 0#define

数据结构链表//consts.h#include<string.h>#include<malloc.h>#include<stdlib.h>#include<stdio.h>#include<limits.h>#include<io.h>#include<math.h>#include<process.h>#define TRUR 1#define FALSE 0#define O

数据结构链表实现集合的交并运算//consts.h#include<string.h>#include<malloc.h>#include<stdlib.h>#include<stdio.h>#include<limits.h>#include<io.h>#include<math.h>#include<process.h>#define TRUR 1#define FALSE 0

#include<iostream> #include<queue> using namespace std; //二叉树结点 typedef struct BiTNode{ //数据 char data; //左右孩子指针 struct BiTNode *lchild,*rchild; }BiTNode,*BiTree; //按