- 二叉搜索树
- 哈希表
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| - 无向图 |
- DFS
- BFS
- 有向图
最小生成树算法
字符串排序
Trie 树
- 每个节点储存一个字母
- 每个节点可以被多个 key 共享
- Trie 树的节点也可以是个 Map
何时找不到 key
- 从 Trie 树上掉落
- 最后的节点是白色的 （染色法，给单词最后字母的节点染成蓝色），如果节点是 Map,则最后的节点有值
Trie API
子字符串查找
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| 数据压缩 | |
| - 霍夫曼压缩 |