王道数据结构PPT讲义

[{"title":"（ 88 个子文件 154.31MB ） 王道数据结构PPT讲义","children":[{"title":"数据结构课件（无水印）","children":[{"title":"第8章 排序","children":[{"title":"8.2_2_希尔排序.pdf <span style='color:#111;'> 1.34MB </span>","children":null,"spread":false},{"title":"8.3_1_冒泡排序.pdf <span style='color:#111;'> 1.90MB </span>","children":null,"spread":false},{"title":"8.5_2_基数排序.pdf <span style='color:#111;'> 1.55MB </span>","children":null,"spread":false},{"title":"8.2_1_插入排序.pdf <span style='color:#111;'> 1.41MB </span>","children":null,"spread":false},{"title":"8.4_2_堆排序.pdf <span style='color:#111;'> 3.06MB </span>","children":null,"spread":false},{"title":"8.7_2_败者树.pdf <span style='color:#111;'> 2.67MB </span>","children":null,"spread":false},{"title":"8.4_1_简单选择排序.pdf <span style='color:#111;'> 668.38KB </span>","children":null,"spread":false},{"title":"8.7_4_最佳归并树.pdf <span style='color:#111;'> 827.24KB </span>","children":null,"spread":false},{"title":"8.4_3_堆的插入删除.pdf <span style='color:#111;'> 904.56KB </span>","children":null,"spread":false},{"title":"8.7_1_外部排序.pdf <span style='color:#111;'> 33.15MB </span>","children":null,"spread":false},{"title":"8.1_排序的基本概念.pdf <span style='color:#111;'> 1.13MB </span>","children":null,"spread":false},{"title":"8.7_3_置换-选择排序.pdf <span style='color:#111;'> 1.17MB </span>","children":null,"spread":false},{"title":"8.3_2_快速排序.pdf <span style='color:#111;'> 2.18MB </span>","children":null,"spread":false},{"title":"8.5_1_归并排序.pdf <span style='color:#111;'> 2.05MB </span>","children":null,"spread":false}],"spread":false},{"title":"第3章 栈和队列","children":[{"title":"3.3.3_栈在递归中的应用.pdf <span style='color:#111;'> 826.09KB </span>","children":null,"spread":false},{"title":"3.4_特殊矩阵的压缩存储.pdf <span style='color:#111;'> 1.01MB </span>","children":null,"spread":false},{"title":"3.2.3_队列的链式实现.pdf <span style='color:#111;'> 940.93KB </span>","children":null,"spread":false},{"title":"3.3.2_栈在表达式求值中的应用(上).pdf <span style='color:#111;'> 679.82KB </span>","children":null,"spread":false},{"title":"3.1.1_栈的基本概念.pdf <span style='color:#111;'> 1.52MB </span>","children":null,"spread":false},{"title":"3.3.2_栈在表达式求值中的应用(下).pdf <span style='color:#111;'> 814.87KB </span>","children":null,"spread":false},{"title":"3.3.4_队列的应用.pdf <span style='color:#111;'> 641.47KB </span>","children":null,"spread":false},{"title":"3.1.3_栈的链式存储实现.pdf <span style='color:#111;'> 830.46KB </span>","children":null,"spread":false},{"title":"3.1.2_栈的顺序存储实现.pdf <span style='color:#111;'> 718.15KB </span>","children":null,"spread":false},{"title":"3.2.1_队列的基本概念.pdf <span style='color:#111;'> 1.19MB </span>","children":null,"spread":false},{"title":"3.2.2_队列的顺序实现.pdf <span style='color:#111;'> 848.58KB </span>","children":null,"spread":false},{"title":"3.2.4_双端队列.pdf <span style='color:#111;'> 588.34KB </span>","children":null,"spread":false},{"title":"3.3.1_栈在括号匹配中的应用.pdf <span style='color:#111;'> 382.50KB </span>","children":null,"spread":false}],"spread":false},{"title":"第1章 绪论","children":[{"title":"1.2_3_算法的空间复杂度.pdf <span style='color:#111;'> 431.79KB </span>","children":null,"spread":false},{"title":"1.2_1_算法的基本概念.pdf <span style='color:#111;'> 745.90KB </span>","children":null,"spread":false},{"title":"1.1_数据结构的基本概念.pdf <span style='color:#111;'> 8.96MB </span>","children":null,"spread":false},{"title":"1.0_开篇_数据结构在学什么.pdf <span style='color:#111;'> 7.66MB </span>","children":null,"spread":false},{"title":"1.2_2_算法的时间复杂度.pdf <span style='color:#111;'> 3.73MB </span>","children":null,"spread":false}],"spread":true},{"title":".DS_Store <span style='color:#111;'> 8.00KB </span>","children":null,"spread":false},{"title":"第4章 串","children":[{"title":"4.1_1_串的定义和基本操作.pdf <span style='color:#111;'> 5.62MB </span>","children":null,"spread":false},{"title":"4.2_1_朴素模式匹配算法.key.pdf <span style='color:#111;'> 9.73MB </span>","children":null,"spread":false},{"title":"4.1_2_串的存储结构.pdf <span style='color:#111;'> 524.39KB </span>","children":null,"spread":false},{"title":"4.2_3_求next数组.pdf <span style='color:#111;'> 8.88MB </span>","children":null,"spread":false},{"title":"4.2_2_KMP算法.pdf <span style='color:#111;'> 2.51MB </span>","children":null,"spread":false}],"spread":true},{"title":"第5章 树和二叉树","children":[{"title":"5.2_1_二叉树的定义和基本术语.pdf <span style='color:#111;'> 484.24KB </span>","children":null,"spread":false},{"title":"5.4_1_树的存储结构.pdf <span style='color:#111;'> 793.06KB </span>","children":null,"spread":false},{"title":"5.3_3_由遍历序列构造二叉树.pdf <span style='color:#111;'> 483.34KB </span>","children":null,"spread":false},{"title":"5.3_5_二叉树的线索化.pdf <span style='color:#111;'> 1.13MB </span>","children":null,"spread":false},{"title":"5.5_3_哈夫曼树.pdf <span style='color:#111;'> 2.65MB </span>","children":null,"spread":false},{"title":"5.5_1_二叉排序树.pdf <span style='color:#111;'> 741.50KB </span>","children":null,"spread":false},{"title":"5.1_1_树的定义和基本术语.pdf <span style='color:#111;'> 2.02MB </span>","children":null,"spread":false},{"title":"5.3_1_二叉树的先中后序遍历.pdf <span style='color:#111;'> 713.62KB </span>","children":null,"spread":false},{"title":"5.3_6_在线索二叉树中找前驱后继.pdf <span style='color:#111;'> 922.53KB </span>","children":null,"spread":false},{"title":"5.3_4_线索二叉树的概念.pdf <span style='color:#111;'> 652.10KB </span>","children":null,"spread":false},{"title":"5.2_2_二叉树的性质.pdf <span style='color:#111;'> 208.30KB </span>","children":null,"spread":false},{"title":"5.5_2_平衡二叉树.pdf <span style='color:#111;'> 1.19MB </span>","children":null,"spread":false},{"title":"5.1_2_树的性质.pdf <span style='color:#111;'> 525.66KB </span>","children":null,"spread":false},{"title":"5.2_3_二叉树的存储结构.pdf <span style='color:#111;'> 369.70KB </span>","children":null,"spread":false},{"title":"5.4_2_树和森林的遍历.pdf <span style='color:#111;'> 327.58KB </span>","children":null,"spread":false},{"title":"5.3_2_二叉树的层次遍历.pdf <span style='color:#111;'> 176.92KB </span>","children":null,"spread":false}],"spread":false},{"title":"第7章 查找","children":[{"title":"7.1_查找的基本概念.pdf <span style='color:#111;'> 635.20KB </span>","children":null,"spread":false},{"title":"7.2_2_折半查找.pdf <span style='color:#111;'> 1.50MB </span>","children":null,"spread":false},{"title":"7.4_2_散列查找(下).pdf <span style='color:#111;'> 1.94MB </span>","children":null,"spread":false},{"title":"7.2_3_分块查找.pdf <span style='color:#111;'> 1.68MB </span>","children":null,"spread":false},{"title":".DS_Store <span style='color:#111;'> 6.00KB </span>","children":null,"spread":false},{"title":"7.3_1_B树.pdf <span style='color:#111;'> 1.13MB </span>","children":null,"spread":false},{"title":"7.3_3_B+树.pdf <span style='color:#111;'> 798.02KB </span>","children":null,"spread":false},{"title":"7.3_2_B树的插入删除.pdf <span style='color:#111;'> 2.03MB </span>","children":null,"spread":false},{"title":"7.2_1_顺序查找.pdf <span style='color:#111;'> 990.77KB </span>","children":null,"spread":false},{"title":"7.4_1_散列查找(上).pdf <span style='color:#111;'> 1.90MB </span>","children":null,"spread":false}],"spread":true},{"title":"第6章 图","children":[{"title":"6.4_4_最短路径问题_Floyd算法.key.pdf <span style='color:#111;'> 1.62MB </span>","children":null,"spread":false},{"title":"6.4_1_最小生成树.key.pdf <span style='color:#111;'> 4.99MB </span>","children":null,"spread":false},{"title":".DS_Store <span style='color:#111;'> 6.00KB </span>","children":null,"spread":false},{"title":"6.2_4_图的基本操作.pdf <span style='color:#111;'> 1.05MB </span>","children":null,"spread":false},{"title":"6.4_2_最短路径问题_BFS算法.key.pdf <span style='color:#111;'> 2.44MB </span>","children":null,"spread":false},{"title":"6.3_2_图的深度优先遍历.key.pdf <span style='color:#111;'> 3.18MB </span>","children":null,"spread":false},{"title":"6.3_1_图的广度优先遍历.key.pdf <span style='color:#111;'> 3.11MB </span>","children":null,"spread":false},{"title":"6.1_1_图的基本概念.pdf <span style='color:#111;'> 3.04MB </span>","children":null,"spread":false},{"title":"6.2_1_邻接矩阵法.pdf <span style='color:#111;'> 1.12MB </span>","children":null,"spread":false},{"title":"6.4_3_最短路径问题_Dijkstra算法.key.pdf <span style='color:#111;'> 1.45MB </span>","children":null,"spread":false},{"title":"6.2_3_十字链表、邻接多重表.pdf <span style='color:#111;'> 655.35KB </span>","children":null,"spread":false},{"title":"6.2_2_邻接表法.pdf <span style='color:#111;'> 768.54KB </span>","children":null,"spread":false}],"spread":false},{"title":"第2章 线性表","children":[{"title":"2.3.2_3_单链表的建立.pdf <span style='color:#111;'> 995.69KB </span>","children":null,"spread":false},{"title":"2.3.1_单链表的定义.pdf <span style='color:#111;'> 1.26MB </span>","children":null,"spread":false},{"title":"2.3.4_循环链表.pdf <span style='color:#111;'> 921.39KB </span>","children":null,"spread":false},{"title":"2.2.1_顺序表的定义.pdf <span style='color:#111;'> 1.02MB </span>","children":null,"spread":false},{"title":"2.3.2_2_单链表的查找.pdf <span style='color:#111;'> 914.86KB </span>","children":null,"spread":false},{"title":"2.3.3_双链表.pdf <span style='color:#111;'> 914.38KB </span>","children":null,"spread":false},{"title":"2.2.2_1_顺序表的插入删除.pdf <span style='color:#111;'> 1.07MB </span>","children":null,"spread":false},{"title":"2.3.5_静态链表.pdf <span style='color:#111;'> 837.88KB </span>","children":null,"spread":false},{"title":"2.1_线性表的定义和基本操作.pdf <span style='color:#111;'> 5.27MB </span>","children":null,"spread":false},{"title":"2.2.2_2_顺序表的查找.pdf <span style='color:#111;'> 770.05KB </span>","children":null,"spread":false},{"title":"2.3.6_顺序表和链表的比较.pdf <span style='color:#111;'> 1017.92KB </span>","children":null,"spread":false},{"title":"2.3.2_1_单链表的插入删除.pdf <span style='color:#111;'> 1.82MB </span>","children":null,"spread":false}],"spread":false}],"spread":true}],"spread":true}]