![[ICO]](/icons/blank.gif){kind=icon}
![[PARENTDIR]](/icons/back.gif){kind=icon}
![[ ]](/icons/compressed.gif){kind=icon}
![[ ]](/icons/layout.gif){kind=icon}
| Name | Last modified | Size | Description |
|---|---|---|---|---|
| Parent Directory | - | ||
| 第七章.zip | 2022-05-16 13:43 | 9.7M | |
| 第六章.zip | 2022-05-16 13:36 | 21M | |
| 1.0_开篇_数据结构在学什么.pdf | 2022-05-16 12:02 | 5.9M | |
| 1.1_数据结构的基本概念.pdf | 2022-05-16 12:54 | 12M | |
| 1.2_1_算法的基本概念.pdf | 2022-05-16 12:14 | 688K | |
| 1.2_2_算法的时间复杂度.pdf | 2022-05-16 12:14 | 3.4M | |
| 1.2_3_算法的空间复杂度.pdf | 2022-05-16 12:05 | 409K | |
| 2.1_线性表的定义和基本操作.pdf | 2022-05-16 12:05 | 1.2M | |
| 2.2.1_顺序表的定义.pdf | 2022-05-16 12:02 | 672K | |
| 2.2.2_1_顺序表的插入删除.pdf | 2022-05-16 12:02 | 751K | |
| 2.2.2_2_顺序表的查找.pdf | 2022-05-16 12:02 | 453K | |
| 2.3.1_单链表的定义.pdf | 2022-05-16 12:02 | 958K | |
| 2.3.2_1_单链表的插入删除.pdf | 2022-05-16 12:02 | 1.7M | |
| 2.3.2_2_单链表的查找.pdf | 2022-05-16 11:56 | 633K | |
| 2.3.2_3_单链表的建立.pdf | 2022-05-16 11:56 | 647K | |
| 2.3.3_双链表.pdf | 2022-05-16 11:56 | 580K | |
| 2.3.4_循环链表.pdf | 2022-05-16 11:56 | 590K | |
| 2.3.5_静态链表.pdf | 2022-05-16 11:59 | 481K | |
| 2.3.6_顺序表和链表的比较.pdf | 2022-05-16 12:00 | 972K | |
| 3.1.1_栈的基本概念.pdf | 2022-05-16 12:00 | 1.1M | |
| 3.1.2_栈的顺序存储实现.pdf | 2022-05-16 12:00 | 715K | |
| 3.1.3_栈的链式存储实现.pdf | 2022-05-16 12:00 | 492K | |
| 3.2.1_队列的基本概念.pdf | 2022-05-16 12:16 | 811K | |
| 3.2.2_队列的顺序实现.pdf | 2022-05-16 12:16 | 823K | |
| 3.2.3_队列的链式实现.pdf | 2022-05-16 12:16 | 613K | |
| 3.2.4_双端队列.pdf | 2022-05-16 12:16 | 248K | |
| 3.3.1_栈在括号匹配中的应用.pdf | 2022-05-16 12:16 | 443K | |
| 3.3.2_栈在表达式求值中的应用(上).pdf | 2022-05-16 12:16 | 677K | |
| 3.3.2_栈在表达式求值中的应用(下).pdf | 2022-05-16 12:16 | 716K | |
| 3.3.3_栈在递归中的应用.pdf | 2022-05-16 12:16 | 526K | |
| 3.3.4_队列的应用.pdf | 2022-05-16 12:12 | 296K | |
| 3.4_特殊矩阵的压缩存储 .pdf | 2022-05-16 12:12 | 1.0M | |
| 3.4_特殊矩阵的压缩存储.pdf | 2022-05-16 12:12 | 1.0M | |
| 4.1_1_串的定义和基本操作.pdf | 2022-05-16 12:12 | 1.6M | |
| 4.1_2_串的存储结构 .pdf | 2022-05-16 12:12 | 562K | |
| 4.1_2_串的存储结构.pdf | 2022-05-16 12:02 | 528K | |
| 4.2_1_串的朴素模式匹配算法.pdf | 2022-05-16 12:02 | 475K | |
| 4.2_2_KMP算法 .pdf | 2022-05-16 12:02 | 1.2M | |
| 4.2_2_KMP算法.pdf | 2022-05-16 12:02 | 1.1M | |
| 4.2_3_Next数组 .pdf | 2022-05-16 12:02 | 802K | |
| 4.2_3_Next数组.pdf | 2022-05-16 12:00 | 734K | |
| 4.2_4_KMP算法再优化 .pdf | 2022-05-16 12:00 | 288K | |
| 4.2_4_KMP算法再优化.pdf | 2022-05-16 12:00 | 237K | |
| 5.1_1_树的定义和基本术语 .pdf | 2022-05-16 12:00 | 2.1M | |
| 5.1_1_树的定义和基本术语.pdf | 2022-05-16 12:18 | 2.1M | |
| 5.1_2_树的性质 .pdf | 2022-05-16 12:18 | 574K | |
| 5.1_2_树的性质.pdf | 2022-05-16 12:18 | 542K | |
| 5.2_1_二叉树的定义和基本术语 .pdf | 2022-05-16 12:18 | 542K | |
| 5.2_1_二叉树的定义和基本术语.pdf | 2022-05-16 12:18 | 500K | |
| 5.2_2_二叉树的性质 .pdf | 2022-05-16 12:08 | 255K | |
| 5.2_2_二叉树的性质.pdf | 2022-05-16 12:08 | 218K | |
| 5.2_3_二叉树的存储结构 .pdf | 2022-05-16 12:08 | 494K | |
| 5.2_3_二叉树的存储结构.pdf | 2022-05-16 12:08 | 441K | |
| 5.3_1_二叉树的先中后序遍历 .pdf | 2022-05-16 12:08 | 898K | |
| 5.3_1_二叉树的先中后序遍历.pdf | 2022-05-16 12:08 | 772K | |
| 5.3_2_二叉树的层次遍历 .pdf | 2022-05-16 12:08 | 208K | |
| 5.3_2_二叉树的层次遍历.pdf | 2022-05-16 12:08 | 189K | |
| 5.3_3_由遍历序列构造二叉树.pdf | 2022-05-16 12:08 | 507K | |
| 5.3_4_线索二叉树的概念 .pdf | 2022-05-16 12:00 | 726K | |
| 5.3_4_线索二叉树的概念.pdf | 2022-05-16 12:00 | 616K | |
| 5.3_5_二叉树的线索化.pdf | 2022-05-16 12:00 | 1.3M | |
| 5.3_6_在线索二叉树中找前驱后继 .pdf | 2022-05-16 12:00 | 1.0M | |
| 5.3_6_在线索二叉树中找前驱后继.pdf | 2022-05-16 12:22 | 953K | |
| 5.4_1_树的存储结构 .pdf | 2022-05-16 12:22 | 922K | |
| 5.4_1_树的存储结构.pdf | 2022-05-16 12:22 | 843K | |
| 5.4_2_树和森林的遍历 .pdf | 2022-05-16 12:21 | 416K | |
| 5.4_2_树和森林的遍历.pdf | 2022-05-16 12:22 | 371K | |
| 5.5_1_二叉排序树 .pdf | 2022-05-16 12:22 | 902K | |
| 5.5_1_二叉排序树.pdf | 2022-05-16 12:22 | 825K | |
| 5.5_2_平衡二叉树 .pdf | 2022-05-16 12:07 | 1.4M | |
| 5.5_2_平衡二叉树.pdf | 2022-05-16 12:07 | 1.3M | |
| 5.5_3_哈夫曼树 .pdf | 2022-05-16 12:21 | 2.7M | |
| 5.5_3_哈夫曼树.pdf | 2022-05-16 12:22 | 2.7M | |
| 6.1_1_图的基本概念 .pdf | 2022-05-16 12:20 | 6.0M | |
| 6.2_1_邻接矩阵法 .pdf | 2022-05-16 12:00 | 761K | |
| 6.2_2_邻接表法 .pdf | 2022-05-16 12:04 | 490K | |
| 6.2_4_图的基本操作 .pdf | 2022-05-16 12:04 | 641K | |
| 6.3_1_图的广度优先遍历 .pdf | 2022-05-16 12:04 | 3.1M | |
| 6.3_2_图的深度优先遍历 .pdf | 2022-05-16 12:12 | 3.1M | |
| 6.4_1_最小生成树 .pdf | 2022-05-16 14:03 | 7.3M | |
| 6.4_2_最短路径问题_BFS算法 .pdf | 2022-05-16 12:08 | 2.3M | |
| 6.4_3_最短路径问题_Dijkstra算法 .pdf | 2022-05-16 12:08 | 1.4M | |
| 6.4_4_最短路径问题_Floyd算法 .pdf | 2022-05-16 12:08 | 1.5M | |
| 6.4_5_有向无环图描述表达式 .pdf | 2022-05-16 12:08 | 972K | |
| 6.4_6_拓扑排序 .pdf | 2022-05-16 12:03 | 3.1M | |
| 6.4_7_关键路径 .pdf | 2022-05-16 12:21 | 1.9M | |
| 7.1_查找的基本概念 .pdf | 2022-05-16 12:21 | 672K | |
| 7.2_1_顺序查找 .pdf | 2022-05-16 12:21 | 1.0M | |
| 7.2_2_折半查找 .pdf | 2022-05-16 12:21 | 1.6M | |
| 7.3_2_B树的插入删除 .pdf | 2022-05-16 12:17 | 2.3M | |
| 7.3_3_B+树 .pdf | 2022-05-16 12:17 | 941K | |
| 7.4_2_散列查找(下) .pdf | 2022-05-16 12:17 | 2.1M | |