eeekkk的专栏

// linklist.cpp : Defines the entry point for the console application.//#include "stdafx.h"#include #include //单链表的实现typedef int DataType;typedef struct node { DataType data; struct node

// DBList.cpp : Defines the entry point for the console application.//#include "stdafx.h"//双向链表的实现//双向链表每个节点都带一个前驱指针和后续指针，分别为LLink,RLink;typedef int DataType;//双向链表数据结构typedef struct Node{

// ListStack.cpp : Defines the entry point for the console application.//#include "stdafx.h"//链式栈的实现//链式栈栈顶指针在头节点，压栈都是压首元节点，相当与链表头插法，出栈也是出首元节点typedef int SElemType;typedef struct node{ SElemT

// Stack.cpp : Defines the entry point for the console application.//#include "stdafx.h"typedef int SElemType;#define INC_SIZE 10#define INIT_SIZE 10////栈的原理与实现//栈(stack) 是只允许在表一端进行插入和删除的线性

// LinkSQueue.cpp : Defines the entry point for the console application.//#include "stdafx.h"//c链式队列的实现//简单的基于单链表操作。多了两个指针。一个队头front,一个队尾指针reartypedef int QElemType;typedef struct node{ QEle

// circqueue.cpp : Defines the entry point for the console application.//#include "stdafx.h"//循环队列的实现（多采用静态分配实现）#define MAX_SIZE 20typedef int QElemType;typedef struct{ QElemType elem[MAX_SIZ