m0_50490844的博客

顺序循环队列（C语言实现）#include <stdio.h>#include <stdlib.h>#define OK 1#define ERROR 0#define MAXQSIZE 100typedef int QElemtype;typedef int Status;typedef struct{ QElemtype *base; int rear; int front;}SqQueue;Status InitQueue(SqQueue &

链栈的基本操作（C语言实现）#include <stdio.h>#include <stdlib.h>#define OK 1#define ERROR 0typedef int SElemtype;typedef int Status;typedef struct StackNode{ SElemtype data; struct StackNode *next;}StackNode,*LinkStack;Status InitStack(LinkStac

顺序栈的基本操作（C语言实现）#include <stdio.h>#include <stdlib.h>#define MAXSIZE 100#define OVERFLOW -1#define OK 1#define ERROR 0typedef int SElemtype;typedef int Status;typedef struct{ SElemtype *top,*base; int stacksize;}Sqstack;Status Ini

单链表的头插法和尾插法（C语言实现）#include <stdio.h>#include <stdlib.h>#define OK 1#define ERROR 0typedef int Elemtype;typedef int Status;typedef struct LNode{ Elemtype data; struct LNode *next;}LNode,*Linklist;void Creatlist_L(Linklist &L,i

链表的基本操作（C语言实现）#include <stdio.h>#include <stdlib.h>#define OK 1#define ERROR 0typedef int Elemtype;typedef int Status;typedef struct LNode{ Elemtype data; struct LNode *next;}LNode,*Linklist;Status Initlist_L(Linklist &L){

顺序表的基本功能（C语言实现）**#include <stdio.h>#include <stdlib.h>#define MAXSIZE 100#define TRUE 1#define OK 1#define FALSE 0#define ERROR 0#define OVERFLOW -1typedef int Elemtype;typedef int Status;typedef struct{ Elemtype *elem; int leng