摘要： #include<iostream.h>#include<stdlib.h>#define OK 1#define OVERFLOW -2#define ERROR 0typedef int Status;typedef int ElemType;#define MAXQSIZE 100 //最大队列长度-1，多留一个元素空间typedef struct{ ElemType *base; //动态分配存储空间 int front; //头指针，若队列不空，指向队列头元素 int rear; //尾指针，若队列不空，指向队列尾元素的下一... 阅读全文

摘要： #include<iostream.h>#include<stdlib.h>#define OK 1#define OVERFLOW -2#define ERROR 0typedef int Status;typedef int QElemType;typedef struct QNode{ //结点类型 QElemType data; struct QNode *next;}QNode,*QueuePtr;typedef struct{ //链队列类型 QueuePtr front; //队头指针 QueueP... 阅读全文

摘要： #include<iostream.h>#include<stdio.h>#include<stdlib.h> //exit的原型定义#define STACK_INIT_SIZE 100#define STACKINCREMENT 10#define OVERFLOW -2#define OK 1#define ERROR 0typedef int Status;typedef char SElemType;typedef struct{ SElemType *base; //栈底指针 SElemType *top; //栈顶指针 int ... 阅读全文

摘要： #include<iostream.h>#include<string.h>#include<stdlib.h> //exit的原型定义#define STACK_INIT_SIZE 8#define STACKINCREMENT 10#define OVERFLOW -2#define OK 1#define ERROR 0typedef int Status;typedef char SElemType;typedef char *string;typedef struct{ SElemType *base; //栈底指针 SElemType *top; 阅读全文

摘要： #include<iostream.h>#include<stdlib.h> //exit的原型定义#define STACK_INIT_SIZE 8#define STACKINCREMENT 10#define OVERFLOW -2#define OK 1#define ERROR 0typedef int Status;typedef int SElemType;typedef struct{ SElemType *base; //栈底指针 SElemType *top; //栈顶指针 int stacksize; // ... 阅读全文

摘要： #include<iostream.h>#include<stdlib.h> //exit的原型定义#define STACK_INIT_SIZE 8#define STACKINCREMENT 10#define OVERFLOW -2#define OK 1#define ERROR 0typedef int Status;typedef char SElemType;typedef struct{ SElemType *base; //栈底指针 SElemType *top; //栈顶指针 int stacksize; //... 阅读全文

摘要： //不需要设表头结点，使用top指向栈顶元素#include<iostream.h>#include<stdlib.h> //exit的原型定义#define STACK_INIT_SIZE 100#define OVERFLOW -2#define ERROR 0#define OK 1typedef int Status;typedef char SElemType;typedef struct SNode{ SElemType data; struct SNode *next;}StackNode,*LinkStack;void InitStack(Lin... 阅读全文

摘要： #include<iostream.h>#include<stdlib.h> //exit的原型定义#define STACK_INIT_SIZE 8#define STACKINCREMENT 10#define OVERFLOW -2#define OK 1#define ERROR 0typedef int Status;typedef char SElemType;typedef struct{ SElemType *base; //栈底指针 SElemType *top; //栈顶指针 int stacksize; // 当前已分配的栈空... 阅读全文

摘要： //(1)编写算法，创建一个带头结点的双向循环链表，其结点结构如下：//(2)编写算法，删除链表上的最后一个结点。//(3)编写算法，遍历链表，输出所有结点的信息。/*#include<stdio.h>#include<stdlib.h>typedef int elemtype;typedef struct node{ struct node *prior; elemtype data; struct node *next;}NODE;NODE *save() //创建头结点{ NODE *newhead; newhead=(NODE *)malloc(... 阅读全文

摘要： #include<stdio.h>#include<stdlib.h>#define null 0typedef struct node{ int number; struct node *next;}student;main(){ student *head,*p,*temp; int i; //建立链表头 //head=p=(student*)malloc(sizeof(student));//分配地址 head->number=1; head->next=NULL; // for(i=2;i<16;i++) { ... 阅读全文