기본 적 인 몇 가지 데이터 구조

typedef struct LNode{
    ElemType data;
    struct LNode *next;
}LNode ,*LinkedList;

typedef struct DNode{
    ElemType data;
    struct DNode *prior ,*next;
}DNode,*DLinkedList;

typedef struct BiTNode{
    ElemType data;
    struct BiTNode *lchild,*rchild;
}BiTNode,* BiTree;

typedef struct CSNode{
    ElemType data;
    struct CSNode *firstchild,*nextsibling;
}CSNode, *CSTree;

typedef struct{
    SElemType *base;
    SElemType *top;
    int stackSize;
}SqStack;

typedef struct SNode{ //    
    ElemType data;
    struct SNode *next;
}SNode,*StackPtr;

typedef struct{
    StackPtr *base;
    StackPtr *top;
    int stackSize; //
}LinkedStack;

typedef struct{ //    
    SElemType *base;
    int front;
    int rear;
}SqQueue;

typedef struct QNode{
    ElemType data;
    struct QNode *next;
}QNode,*QueuePtr;

typedef struct{
    QueuePtr front;
    QueuePtr rear;
}LinkedQueue;

typedef  struct{
    unsigned int weight;
    unsigned int parent,lchild,rchild;  
}HFNode, *HuffmanTree

#define MAXSIZE 12500
typedef struct {
    int i, j;        // i, j
    ElemType e;
}Triple;
typedef struct {
    Tripe  data[MAXSIZE + 1];
    int rowNum, colNum, nozeroNum;   /* mu     nu     tu       */
}TSMatrix;

typedef struct{
    KeysType keys[MAX_NUM_OF_KEY];  //   
    InfoType info;
    int next;
}SLCell;                           //         
typedef struct{
    SLCell r[MAX_SPACE];       //          ，r[0]    
    int keynum;                //         
    int renum;                 //        
}SLList;                       //      
typedef int ArrType[REDIX];    //