2021-09-08 00:27:19 +08:00
|
|
|
# 树🌲
|
2019-10-08 20:24:01 +08:00
|
|
|
|
|
|
|
|
介绍树相关的算法
|
|
|
|
|
|
2021-09-08 00:27:19 +08:00
|
|
|
* 二叉树
|
2017-03-21 11:22:10 +08:00
|
|
|
* 二叉查找树
|
2021-09-08 00:27:19 +08:00
|
|
|
* AVL树
|
2021-10-16 01:52:41 +08:00
|
|
|
* 红黑树
|
|
|
|
|
* B树 : B树, B+树(mysql索引使用B+树的数据结构)
|
2017-03-21 11:22:10 +08:00
|
|
|
* 字典树trie(前缀树，单词查找树)
|
|
|
|
|
* 伸展树
|
|
|
|
|
* 后缀树
|
2021-09-08 00:27:19 +08:00
|
|
|
* 红黑树
|
|
|
|
|
* 二叉堆（优先队列）
|
2017-03-21 11:22:10 +08:00
|
|
|
* Treap 树
|
2021-09-08 00:27:19 +08:00
|
|
|
* 赫夫曼编码 Huffman
|
|
|
|
|
|
|
|
|
|
|
2021-11-07 01:15:35 +08:00
|
|
|
## 二叉树
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2021-09-08 00:27:19 +08:00
|
|
|
## [二叉查找树](2-二叉查找树/二叉查找树.md)
|
|
|
|
|
|
2021-09-13 14:43:50 +08:00
|
|
|
快速排序就是个二叉树的前序遍历，归并排序就是个二叉树的后序遍历
|
|
|
|
|
|
|
|
|
|
|
2021-09-08 00:27:19 +08:00
|
|
|
## [AVL树](3-平衡树AVL/README.md)
|
|
|
|
|
|
2021-11-06 22:03:15 +08:00
|
|
|
绝对的平衡二叉树；
|
2021-09-08 00:27:19 +08:00
|
|
|
|
2021-10-18 15:59:42 +08:00
|
|
|
|
2021-10-16 01:52:41 +08:00
|
|
|
## [红黑树](9-红黑树%20R-B%20tree/红黑树.md)
|
|
|
|
|
|
2021-11-06 22:03:15 +08:00
|
|
|
弱平衡二叉树；使用广泛
|
2021-10-16 01:52:41 +08:00
|
|
|
|
2021-10-18 16:00:23 +08:00
|
|
|
|
2021-09-08 00:27:19 +08:00
|
|
|
## [字典树trie](4-字典树Trie/README.md)
|
|
|
|
|
|
|
|
|
|
字典树也叫前缀树，单词查找树
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
## [伸展树](5-伸展树/伸展树.md)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
## [后缀树](6-后缀树/后缀树.md)
|
|
|
|
|
|
|
|
|
|
## B树
|
|
|
|
|
|
|
|
|
|
* [B树](7-B树/B树.md)
|
|
|
|
|
* [B+树](7-B树/B+树.md) mysql 索引使用 B+树 的数据结构
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
## [二叉堆](8-堆/堆.md)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-05-16 20:11:50 +08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
