本人讲授数据结构课程时的所写的示例程序，结构清晰规范，有注释，全部可编译运行，包括如下代码：

长整数：ch0_bigint2.c

顺序表的实现：ch2_stable.c

链表的实现ch2_ltable.c

合并两个有序表：ch2_stable_merge.c

表达式计算：ch3_express.c

队列的链式实现：ch3_lqueue.c

栈的链式实现：ch3_lstack.c

迷宫求解：ch3_maze.c

队列的顺序实现：ch3_squeue.c

栈的顺序实现：ch3_sstack.c

括号的匹配检验：ch3_sstack_().c

串的定长实现：ch4_sstring.c

串的模式匹配：ch4_string_math.c

广义表的实现：ch5_GList.c

树的遍历：ch6_traverse.c

插入排序：ch10_InsertSort.c

拓扑排序和关键路径：ch7_critical_path.c-I taught courses at the time of the data structure of the sample written procedures, including the following code:

Long integer: ch0_bigint2.c

Implementation of the order form: ch2_stable.c

List of implementation ch2_ltable.c

Orderly merger of the two tables: ch2_stable_merge.c

Calculated expression: ch3_express.c

Queue implementation chain: ch3_lqueue.c

Chain stack implementation: ch3_lstack.c

Maze Solving: ch3_maze.c

The order of the queue implementation: ch3_squeue.c

The order of the stack implementation: ch3_sstack.c

Parentheses matching test: ch3_sstack_ (). C

Implementation of fixed-length string: ch4_sstring.c

String pattern matching: ch4_string_math.c

Generalized table implementation: ch5_GList.c

Tree traversal: ch6_traverse.c

Insertion Sort: ch10_InsertSort.c

Topological sort and the critical path: ch7_critical_path.c