没有合适的资源?快使用搜索试试~ 我知道了~
资源推荐
资源详情
资源评论
Left-Leaning
Red-Black Trees
Robert Sedgewick
Princeton University
Original version: Data structures seminar at Dagstuhl (Feb 2008)
•
red-black trees made simpler (!)
•
full delete() implementation
This version: Analysis of Algorithms meeting at Maresias (Apr 2008)
•
back to balanced 4-nodes
•
back to 2-3 trees (!)
•
scientific analysis
Addendum: observations developed after talk at Maresias
Java code at www.cs.princeton.edu/~rs/talks/LLRB/Java
Movies at www.cs.princeton.edu/~rs/talks/LLRB/movies
Introduction
2-3-4 Trees
Red-Black Trees
Left-Leaning RB Trees
Deletion
Introduction
2-3-4 Trees
LLRB Trees
Deletion
Analysis
Red-black trees
are now found throughout our computational infrastructure
Textbooks on algorithms
Library search function in many programming environments
Popular culture (stay tuned)
Worth revisiting?
Introduction
. . .
. . .
Introduction
2-3-4 Trees
LLRB Trees
Deletion
Analysis
Red-black trees
are now found throughout our computational infrastructure
Typical:
Introduction
2-3-4 Trees
LLRB Trees
Deletion
Analysis
Digression:
Red-black trees are found in popular culture??
剩余88页未读,继续阅读
资源评论
- 落小亦2013-10-03很好= =只是如果是双语的就更好了= =
- yfliu872014-07-23很喜欢R Sedgewick的风格 红黑树讲解得很清晰
Goahead123321
- 粉丝: 49
- 资源: 4
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功