数据结构和算法内容提纲.docVIP

读书笔记-数据结构算法提纲 PAGE 2 目录 TOC \o 1-3 \h \z \u 1 二叉查找树 2 Operations 3 2 平衡二叉查找树 10 2.1 R-Btree 10 Terminology 11 Applications and related data structures 12 Operations 12 2.2 AVLTree 16 Operations 17 2.3 Splay Tree 20 Advantages and disadvantages 21 Operations 21 3 堆（优先队列） 24 通用堆的实现 24 算法导论中堆的实现 26 Binomial heap 28 Fibonacci heap 30 4 多叉树 35 4.1 B树 35 基本定义 35 B树的插入 37 B树的删除 37 4.2 B*树 39 4.3 B+树 41 4.4 Trie树 42 4.5 PATRICIA Trie 44 Na?ve PATRICIA Trie 44 广义PATRICIA 45 5 排序算法 47 5.1 Na?ve的排序算法 47 5.2 高级的排序算法 49 5.3 排序算法性能总结 53 7 图论算法 54 7.1 相关概念 54 7.2 图的存储 55 7.3 图的遍历 56 深度优先 56 广度优先 57 7.4 图的连通性 57 无向图的连通分量和生成树 57 7.5 最小生成树 59 Prim算法 59 Kruskal算法 60 7.6 最短路径 61 Dijkstras algorithm 61 8 散列表 62 相关概念描述： 62 Resizing by copying all entries 63 Incremental resizing 63 9 外排序 66 9.1 RUN生成算法 66 9.2 归并RUN算法 67 赢者树 68 败者树 70 10 不相交集合 73 Disjoint-set linked lists （不相交集合的链表表示） 73 Disjoint-set forests（不相交集合森林） 74 二叉查找树 In \o Computer science computer science, a binary search tree (BST) is a \o Node (computer science) node based \o Binary tree binary tree \o Data structure data structure which has the following properties: [1] The left \o Tree (data structure) subtree of a node contains only nodes with keys less than the nodes key. The right subtree of a node contains only nodes with keys greater than the nodes key. Both the left and right subtrees must also be binary search trees. From the above properties it naturally follows that: Each node (item in the tree) has a distinct key. Generally, the information represented by each node is a record rather than a single data element. However, for sequencing purposes, nodes are compared according to their keys rather than any part of their associated records. The major advantage of binary search trees over other data structures is that the related \o