- 算法可视化: https://www.cs.usfca.edu/~galles/visualization/Algorithms.html (opens new window)
- Algorithms: https://algs4.cs.princeton.edu/home/ (opens new window)
- 为什么快速排序占用额外的空间：https://stackoverflow.com/questions/12573330/why-does-quicksort-use-ologn-extra-space/12573403 (opens new window)
- 维基百科，归并排序：https://en.wikipedia.org/wiki/Merge_sort (opens new window)
- 维基百科，堆排序：https://en.wikipedia.org/wiki/Heapsort (opens new window)
- 堆排序：https://brilliant.org/wiki/heap-sort (opens new window)
- 堆排序：http://www.codecodex.com/wiki/Heapsort (opens new window)
- 维基百科，AVL树：https://zh.wikipedia.org/wiki/AVL%E6%A0%91 (opens new window)
- 2-3树与2-3-4树：https://blog.csdn.net/qq_25940921/article/details/82183601 (opens new window)
- 什么是2-3树：https://zhuanlan.zhihu.com/p/92394224 (opens new window)
- 2-3树与红黑树：https://riteme.site/blog/2016-3-12/2-3-tree-and-red-black-tree.html (opens new window)
- 2-3TreePPT:https://www.cs.drexel.edu/~amd435/courses/cs260/lectures/L-6_2-3_Trees.pdf (opens new window)
- 左倾红黑树代码实现：https://algs4.cs.princeton.edu/33balanced/RedBlackBST.java.html (opens new window)
- 通过2-3-4树理解红黑树：https://www.cnblogs.com/zhenbianshu/p/8185345.htm (opens new window)
- 维基百科，2–3–4 tree：https://en.wikipedia.org/wiki/2%E2%80%933%E2%80%934_tree (opens new window)
- 30张图带你彻底理解红黑树：https://www.jianshu.com/p/e136ec79235c (opens new window)