图 书 馆
红-黑树，旋转，插入，缺失Lecture 10: Red-black Trees, Rotations, Insertions, Deletions |
|
| 课程网址: | http://videolectures.net/mit6046jf05_demaine_lec10/ |
| 主讲教师: | Erik Demaine |
| 开课单位: | 麻省理工学院 |
| 开课时间: | 2009-02-10 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | //"Good morning. It looks like 9:30 is getting earlier and earlier for everyone. Hello to all the people watching at home. I think there should be a requirement that if you're watching the video, you can only watch it 9:30-11:00 on Sunday, or at least start watching then just so you can all feel our mornings. Today, we're going to talk about balanced search trees. Now, we've hinted at this for a while. Our goal today is to get a search tree data structure, so we can insert, delete, and search all at log n time for operations. So, we want a tree that's guaranteed to be log n in height. So, that's a balanced search tree data structure..."// |
| 关 键 词: | 平衡搜索树; 红黑树; 伪代码 ; 图形符号 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2020-06-12：张荧(课程编辑志愿者) |
| 阅读次数: | 44 |