吴英峰的博客

#include #include typedef int Elemtype;typedef struct Node{ Elemtype data; struct Node *prior; //前驱指针 struct Node *next; //后继指针 }Node,*LinkList;//创建头结点 void create_ListHead(LinkList *pH

#include #include #include #include #define MAXSIZE 3//结构体定义typedef int elemtype;typedef struct sqList{ elemtype *data; int size; //当前长度 int capacity; //当前容量 }sqList; //初始化void i

#include <stdio.h>#include <stdlib.h> typedef int Elemtype;typedef struct Node{ Elemtype data; struct Node *next;}Node,*LinkList;/*初始化链表需要修改头指针，修改头指针则必须用二级指针或一级指针的引用做参数，这里用二级指针*//*原...

#include #include typedef int Elemtype;typedef struct StackNode{ Elemtype data; struct StackNode *next;}StackNode,*LinkStackPtr;typedef struct LinkStack{ LinkStackPtr top; int size;}LinkSt

#include #include /* 定义：front指针指向头结点，当front==rear时，表示空队列 */ typedef int QElemtype;typedef struct QNode{ QElemtype data; struct QNode *next;}QNode,*QueuePtr;typedef struct{ QueuePtr front,r

带头结点的线索二叉树（如图），头结点的lchild指针指向二叉树的根结点(A)，rchild指针指向中序遍历时访问的最后一个结点(G)。源码：#include <stdio.h> #include <stdlib.h>#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define OVERFLOW...

#include <stdio.h>#define MAXSIZE 20typedef int Elemtype;typedef struct Node{ Elemtype data[MAXSIZE]; int length;}sqList;//初始化 void initList(sqList *L){ L->length=0; printf("OK\n...