Commitd6b759a

committed

2017 8.28

1 parentdabdf8e commitd6b759aCopy full SHA for d6b759a

File tree

-0

lines changed

-0

lines changed

Lines changed: 3 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1040,6 +1040,9 @@ AVL是严格平衡树，因此在增加或者删除节点的时候，根据不`
`1040`	`1040`
`1041`	`1041`	`所以简单说，如果你的应用中，搜索的次数远远大于插入和删除，那么选择AVL，如果搜索，插入删除次数几乎差不多，应该选择RB。`
`1042`	`1042`
	`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`	`+`
`1043`	`1046`	`#编程题`
`1044`	`1047`
`1045`	`1048`	`##1 台阶问题/斐波纳挈`

Comments

(0)