超详细!红黑树详解文章汇总
1. 第一章:二叉查找树
2. 第二章:2-3查找树
3. 第三章:红黑树
4. 第四章:二叉查找树和红黑树的性能比较
5. 双向链接的BST和BBST
6. 附录:项目代码
Description | Entry File |
---|---|
Binary Search Tree ( put(), deleteMin(), deleteMax(), delete(), min(), max(), etc.) | BinarySearchTree.java |
Red Black Tree ( put(), deleteMin(), deleteMax(), delete(), min(), max(), etc. ) | RedBlackTree.java |
Segment Tree ( Range maximum and minimum Query ) | SegmentTree.java |
Priority Queue | MyPriorityQueue.java |
Doubly Linked Binary Search Tree ( With the ability delete / insert a node directly from / into the BST ) | DoublyLinkedBST.java |
Doubly Linked Red Black Tree ( With the ability delete / insert a node directly from / into the R-B Tree ) | DoublyLinkedRBT.java |
7. 特别感谢
- 感谢 @SENNICHEN 制作系列文章封面图
8. 免责声明
※ 本文之中如有错误和不准确的地方,欢迎大家指正哒~
※ 此项目仅用于学习交流,请不要用于任何形式的商用用途,谢谢呢;