We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent d6b759a commit c2947cdCopy full SHA for c2947cd
1 file changed
Readme.md
@@ -1041,6 +1041,7 @@ AVL是严格平衡树,因此在增加或者删除节点的时候,根据不
1041
所以简单说,如果你的应用中,搜索的次数远远大于插入和删除,那么选择AVL,如果搜索,插入删除次数几乎差不多,应该选择RB。
1042
1043
红黑树详解: https://xieguanglei.github.io/blog/post/red-black-tree.html
1044
+
1045
教你透彻了解红黑树: https://github.com/julycoding/The-Art-Of-Programming-By-July/blob/master/ebook/zh/03.01.md
1046
1047
# 编程题
0 commit comments