10000 2017 8.28 · pythonpeixun/interview_python@d6b759a · GitHub
[go: up one dir, main page]
Skip to content

Commit d6b759a

Browse files
584807419584807419
committed
2017 8.28
1 parent dabdf8e commit d6b759a

File tree

1 file changed

+3
-0
lines changed

1 file changed

+3
-0
lines changed

‎Readme.md

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1040,6 +1040,9 @@ AVL是严格平衡树，因此在增加或者删除节点的时候，根据不
10401040

10411041
所以简单说，如果你的应用中，搜索的次数远远大于插入和删除，那么选择AVL，如果搜索，插入删除次数几乎差不多，应该选择RB。
10421042

1043+
红黑树详解: https://xieguanglei.github.io/blog/post/red-black-tree.html
1044+
教你透彻了解红黑树: https://github.com/julycoding/The-Art-Of-Programming-By-July/blob/master/ebook/zh/03.01.md
1045+
10431046
# 编程题
10441047

10451048
## 1 台阶问题/斐波纳挈

0 commit comments

Comments
 (0)
0