ck0816的博客

#include <stdio.h> #include <malloc.h> typedef struct node { int num; node* next; } NODE; int lenght = -1;//线性表的链式结构的长度 /* 创建节点 */ NODE* create_node(int num) { NODE* n = (NODE*...

#include <stdio.h> #include <malloc.h> //循环链表 typedef struct node { int num; node* next; } NODE; NODE* fool;//尾结点 int lenght = -1;//链表的长度 NODE* create_node(int num) { NODE* n = (N...

#include <stdio.h> #include <malloc.h> //双向链表 typedef struct node { //结点 int num; node* prior; /*前驱指针*/ node* next; /*后继指针*/ } NODE; NODE* last = NULL; //记录上一个结点指针 /** 创建一...

#include <stdio.h> #include <malloc.h> #define ERROR false #define OK true #define MAXSIZE 5 typedef int sElemType; typedef struct { sElemType data[MAXSIZE]; int top; } sqStack; //压...

#include <stdio.h> #include <malloc.h> #include <stdio.h> #define MAXSIZE 10 #define ERROR false #define OK true typedef int sElemType; typedef struct { sElemType data[MAXSIZE]; ...

#include <stdio.h> #include <malloc.h> typedef int sElemType; typedef struct stackNode { sElemType e; stackNode* next; } StackNode; typedef struct linkStack { StackNode* top; int c...

#include <stdio.h> #include <malloc.h> //排序二叉树 typedef struct node { int num; node* left; node* right; } NODE; //创建节点 NODE* create_node(int num) { NODE* n = (NODE*) malloc(sizeof(NO...