YnnuSL的博客

动态数组 用动态数组实现：增加数组长度、删除元素、合并2个有序数组 #include <stdio.h> #include <stdlib.h> #define TRUE 1 #define FALSE 0 #define OVERFLOW -2 #define ERROR 0 #define OK 1 #define MAX_QSIZE 5 #define INCREM...

匹配字符串 #include <stdio.h> #include <stdlib.h> #define TRUE 1 #define FALSE 0 #define OVERFLOW -2 #define ERROR 0 #define OK 1 #define MAX_QSIZE 5 #define INCREMENT 2 int stringMatch(char...

用数组实现顺序链表 #include <stdio.h> #include <stdlib.h> #define TRUE 1 #define FALSE 0 #define OVERFLOW -2 #define ERROR 0 #define OK 1 #define MAX_QSIZE 5 typedef int elemType; typedef struc...

单链表 #include <stdio.h> #include <stdlib.h> #define TRUE 1 #define FALSE 0 #define OVERFLOW -2 #define ERROR 0 #define OK 1 #define MAX_QSIZE 5 typedef int elemType; typedef struct lNod...

用链表实现链式栈 #include <stdio.h> #include <stdlib.h> #define TRUE 1 #define FALSE 0 #define OVERFLOW -2 typedef int elemType; typedef struct stackNode { elemType data; struct stackNode * p...

用链表实现链式队列 #include <stdio.h> #include <stdlib.h> #define TRUE 1 #define FALSE 0 #define OVERFLOW -2 #define ERROR 0 #define OK 1 typedef int elemType; typedef struct qNode { elemType d...

用数组实现循环队列 #include <stdio.h> #include <stdlib.h> #define TRUE 1 #define FALSE 0 #define OVERFLOW -2 #define ERROR 0 #define OK 1 #define MAX_QSIZE 5 typedef int elemType; typedef struc...

数据结构索引 栈 用数组实现顺序栈 用链表实现链式栈 队列 用链表实现链式队列 用数组实现循环队列 链表 单链表

二叉树 C++实现 支持插入、删除、查找操作 实现二叉树的前、中、后序遍历（包括递归和非递归） #include <climits> #include <iostream> #include <stack> #ifndef BINARY_SEARCH_TREE #define BINARY_SEARCH_TREE const int INF = INT_M...