Abser的博客

1树的存储 #define maxsize 100; typedef char elemtype; struct tnode {elemtype data; int parent; }; struct tnode { elemtype data; struct tnode parent; } struct tnode *p;//树的链式存储 2.二叉树的建立 #define NULL 0 t...

基本线性表定义 #define maxsize 100 typedef int elemtype; typedef struct{ elemtype num[maxsize]; int length; }List; 1.线性表的初始化 （将长度设置为0） void Initlist(List L) { L.length=0; } 2.置空基本线性表 void clearlist(Li...

顺序基本定义 typedef 100 maxsize; typedef int elemtype; elemtype item[maxsize]; int front; int rear; 结构定义 #define maxsize 100; typedef int elemtype; struct qnode{ elemtype num[maxsize]; int front ,rear; ...

堆栈 顺序存储 #define maxsize 10; typedef int elemtype; struct stack{ elemtype num[maxsize]; int top; }; 1.判断堆栈是否为空 int emptyst(struct stack S) { return(S.top == -1); } 2.判断堆栈是否已满的函数 int fullst(struct s...

链表的定义 #define NULL 0 #define LEN sizeof(Lnode) typedef int elemtype; struct Lnode { elemtype data; struct Lnode *next; }; struct Lnode *head,p; 1单链表的初始化 struct Lnode *initlist(struct Lnode *head)...