8000 2017 8.28 · pythonpeixun/interview_python@c2947cd · GitHub
[go: up one dir, main page]

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Commit c2947cd

Browse files
committed
2017 8.28
1 parent d6b759a commit c2947cd

File tree

1 file changed

+1
-0
lines changed

1 file changed

+1
-0
lines changed

Readme.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1041,6 +1041,7 @@ AVL是严格平衡树,因此在增加或者删除节点的时候,根据不
10411041
所以简单说,如果你的应用中,搜索的次数远远大于插入和删除,那么选择AVL,如果搜索,插入删除次数几乎差不多,应该选择RB。
10421042

10431043
红黑树详解: https://xieguanglei.github.io/blog/post/red-black-tree.html
1044+
10441045
教你透彻了解红黑树: https://github.com/julycoding/The-Art-Of-Programming-By-July/blob/master/ebook/zh/03.01.md
10451046

10461047
# 编程题

0 commit comments

Comments
 (0)
0