Will的专栏

编译环境：VC++6.0 #include#include#include#define ERROR 0#define OK  1typedef char ElemType;typedef enum PointerTag{Link,Thread};  /* Link==0: 指针 Thread==1: 线索 *//* 二叉树结构体 */typedef struct _ThrBi

<br />CircularQueue.h<br />#ifndef SQQUEUE_H_H #define OK 0 #define ERROR -1 #define MAX_SIZE 5 typedef int type; typedef struct SNode { type date[MAX_SIZE]; int front; //队头指针 int rear; //对尾指针 int queue_length; int queue_size; }SqQueue

<br />LinkQueue.h<br /> <br />#ifndef LINKQUEUE_H_H #define OK 0 #define ERROR -1 typedef int type; typedef struct QNode { type date; struct QNode *next; }QNode; typedef struct { QNode *front; QNode *rear; }LinkQueue; int init_linkQueue

<br />SString.h<br /> <br />#ifndef SSTRING_H_H #define OK 0 #define ERROR -1 #define MAX_LENGTH 255 typedef unsigned char SString[MAX_LENGTH + 1]; //第0个位置存放串的长度 int sstr_assign(SString, const char*); int sstr_index(SString, SString, int); int sstr_

<br />KMP.H<br /> <br />#ifndef KMP_H_H #define OK 0 #define ERROR -1 #define MAX_LENGTH 255 typedef unsigned char SString[MAX_LENGTH + 1]; //第0个位置存放串的长度 int sstr_assign(SString, const char*); int sstr_print(SString); int print_nextval(SString, int*

Matrix.h#ifndef MATRIX_H_H #define OK 0 #define ERROR -1 #define MAX_DIM_SIZE 8 typedef int ElemType; typedef struct { ElemType *base; //矩阵基地址 int dim; //矩阵维数 int *bounds; //保存维界值。如A[3][2] bounds[0] = 3, bounds[1] = 2 int *constants; //保

<br />BiTree.h<br /> <br />#ifndef BITREE_H_H #define OK 1 #define ERROR 0 typedef char ElemType; typedef struct BiLNode { ElemType data; struct BiLNode *lchild; struct BiLNode *rchild; }BiTree; int init_BiTree(BiTree*); int make_node(BiLNode

<br />CrossList.h<br /> <br />#ifndef CROSSLIST_H_H #define OK 1 #define ERROR 0 typedef int ElemType; typedef struct OLNode { ElemType data; int i, j; struct OLNode *right, *down; }OLNode; typedef struct { OLNode *rhead, *chead; int mu

SString.h#ifndef SSTRING_H_H #define OK 0 #define ERROR -1 #define MAX_LENGTH 255 typedef unsigned char SString[MAX_LENGTH + 1]; //第0个位置存放串的长度 int sstr_assign(SString, const char*); int sstr_print(SString); int sstr_copy(SString, SString); int sstr

CSTree.h#ifndef CSTREE_H_H #define OK 1 #define ERROR 0 #define MAX(x,y) (x) > (y) ? (x) : (y) typedef void* ElemType; typedef struct CSNode { ElemType data; struct CSNode *first_child, *next_sibling; }*CSTree; int init_CSTree(CSTree); int mak

<br />HString.h<br /> <br />#ifndef HSTRING_H_H #define OK 0 #define ERROR -1 typedef struct { char *ch; int length; }HString; int hstr_assign(HString*, const char*); int hstr_print(HString*); int hstr_length(HString*); int hstr_compare(HStrin

SString.h#ifndef SSTRING_H_H #define OK 0 #define ERROR -1 #define MAX_LENGTH 255 typedef unsigned char SString[MAX_LENGTH + 1]; //第0个位置存放串的长度 int sstr_assign(SString, const char*); int sstr_print(SString); int sstr_copy(SString, SString); int sstr

<br />SqQueue.h<br />#ifndef SQQUEUE_H_H #define OK 0 #define ERROR -1 #define MAX_SIZE 100 typedef int type; typedef struct SNode { type date[MAX_SIZE]; int front; //队头指针 int rear; //对尾指针 int queue_length; int queue_size; }SqQueue;

#include#include#include#include#define OK  1#define ERROR 0#define INFINITY -1        /* -1代表无穷 */#define MAX_VERTEX_NUM 20       /* 最大顶点个数 */typedef int VertexType;        /* 向量的类型 */typedef int I

#include#include#define MAX_VERTEX_NUM 20#define OK  1#define ERROR 0typedef int InfoType;       /* 该弧相关信息的指针类型 */typedef char VertexType;      /* 顶点的类型 */typedef struct ArcNode       /* 弧结点的结构 */

SLinkList.h头文件 #ifndef SLINKLIST_H_H #define MAX_SIZE 100 #define OK 0 #define ERROR -1 typedef int type; typedef struct SNode { type elem; int cur; }SLinkList[MAX_SIZE]; int init_slinkList(SLinkList); int malloc_node(SLinkList); void fre

DLinkList.h头文件#ifndef DLINKLIST_H_H #define OK 0 #define ERROR -1 typedef int type; typedef struct DLNode { type elem; struct DLNode *prior; struct DLNode *next; }*DLinkList, DLNode; int init_dlinkList(DLinkList*); int create_dlinkList(DLin

<br />SqStack.h头文件<br />#ifndef SQSTACK_H_H #define OK 0 #define ERROR -1 #define MAX_SIZE 100 typedef int type; typedef struct SNode { type *base; type *top; int stack_size; int stack_length; }SqStack; int init_stack(SqStack*); int dest

<br />LinkStack.h头文件<br />#ifndef LINKSTACK_H_H #define OK 0 #define ERROR -1 typedef int type; typedef struct LNode { type data; struct LNode *next; }*LinkStack; int init_linkStack(LinkStack*); int make_node(LNo

Stack.h#ifndef STACK_H_H #define OK 0 #define ERROR -1 typedef struct Point { int x; int y; }Point; typedef struct Stack { Point pt; //保存坐标点 struct Stack *next; }*LinkStack; int init_linkStack(LinkStack*); int make_node(Stack**);

<br />#ifndef LIST_H_H #define LIST_INIT_SIZE 100 #define OK 0 #define ERROR -1 typedef int type; typedef struct Node { type *elem; int list_length; int list_size; }SqList; // create list by array int compare(SqList *list, type e) {

<br />LinkList.h头文件<br />#ifndef LINKLIST_H_H #define OK 0 #define ERROR -1 typedef int type; typedef struct LNode { type elem; struct LNode *next; }LNode,*LinkList; int create_linkList(LinkList); int init_linkList(LinkList*); int print_link

<br />HuffmanTree.h<br /> <br />#ifndef HUFFMANTREE #define OK 1 #define ERROR 0 typedef void* ElemType; typedef char** HuffmanCode; typedef struct HTNode { ElemType weight; unsigned int parent, lchild, rchild; }*HuffmanTree; int init_Huffman