By learning this course, you will get a comprehensive grasp of hashing and typical balanced binary search trees, as well as their applications. By the end of this course, you will be able to understand the principle of Hashing, design and implement Hashtables for real problems, understand and implement typical balanced binary search trees such as Splay tree, Red-Black tree as well as B-tree, use BBST to solve various problems such as range query.
This course is part of the Data Structures and Algorithms Specialization
Data Structures and Algorithms (III)
Offered By
About this Course
2,807 recent views
What you will learn
Algorithms used to solve complex problems
Principles and methods in the design and implementation of various data structures
Skills for algorithm design and performance analysis
Background on fundamental data structures and recent results
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Course 3 of 4 in the
Flexible deadlines
Reset deadlines in accordance to your schedule.
Intermediate Level
Basic Computer Science and programming skills
Approx. 16 hours to complete
Suggested: 10 hours/week
Chinese (Simplified)
Subtitles: Chinese (Simplified)
Offered by
Tsinghua University
Free online courses from Tsinghua University
Syllabus - What you will learn from this course
1 hour to complete
第零章
1 hour to complete
5 readings
5 readings
写在选课之前10m
考核方式5m
课程教材与讲义10m
关于讨论区5m
微信平台3m
3 hours to complete
第八章 高级搜索树（上）
本章内容为：高级搜索树
3 hours to complete
41 videos (Total 140 min)
41 videos
08-A1-2：局部性2m
08-A1-3：自适应调整5m
08-A1-4：逐层伸展2m
08-A1-5：实例3m
08-A1-6：一步一步往上爬1m
08-A1-7：最坏情况6m
08-A2-1：双层伸展1m
08-A2-2：子孙异侧2m
08-A2-3：子孙同侧3m
08-A2-4：点睛之笔6m
08-A2-5：折叠效果2m
08-A2-6：分摊性能1m
08-A2-7：最后一步1m
08-A3-1：功能接口1m
08-A3-2：伸展算法2m
08-A3-3：四种情况2m
08-A3-4：查找算法2m
08-A3-5：插入算法3m
08-A3-6：删除算法4m
08-A3-7：综合评价6m
08-B1-1：640KB2m
08-B1-2：越来越大的数据3m
08-B1-3：越来越小的内存3m
08-B1-4：一秒与一天3m
08-B1-5：分级I/O3m
08-B1-6：1B = 1KB2m
08-B2-1：观察体验4m
08-B2-2：多路平衡3m
08-B2-3：还是I/O4m
08-B2-4：深度统一2m
08-B2-5：阶次含义3m
08-B2-6：紧凑表示2m
08-B2-7：BTNode2m
08-B2-8：BTree1m
08-B3-1：算法过程7m
08-B3-2：操作实例5m
08-B3-3：算法实现4m
08-B3-4：主次成本4m
08-B3-5：最大高度6m
08-B3-6：最小高度3m
15 practice exercises
局部性 QUIZ2m
逐层伸展 QUIZ3m
双层伸展 QUIZ3m
折叠效果 QUIZ3m
分摊性能 QUIZ3m
四种情况 QUIZ3m
综合评价 QUIZ3m
越来越小的内存 QUIZ2m
一秒与一天 QUIZ2m
观察体验 QUIZ2m
还是I/O QUIZ2m
阶次含义 QUIZ3m
算法过程 QUIZ3m
算法实现 QUIZ3m
最大高度 QUIZ3m
4 hours to complete
第八章 高级搜索树（下）
本章内容为：高级搜索树
4 hours to complete
36 videos (Total 145 min)
36 videos
08-B4-2：分裂5m
08-B4-3：再分裂1m
08-B4-4：分裂到根2m
08-B4-5：实例演示6m
08-B5-1：算法框架3m
08-B5-2：旋转6m
08-B5-3：合并5m
08-B5-4：实例演示7m
08-B5-5：道法自然4m
08-XA1-1：观察体验2m
08-XA1-2：持久性5m
08-XA1-3：关联性4m
08-XA1-4：O(1)重构2m
08-XA2-1：定义规则3m
08-XA2-2：实例验证3m
08-XA2-3：提升变换3m
08-XA2-4：末端节点2m
08-XA2-5：红黒树，即是B-树3m
08-XA2-6：平衡性6m
08-XA2-7：接口定义2m
08-XA3-1：以曲为直2m
08-XA3-2：双红缺陷5m
08-XA3-3：算法框架1m
08-XA3-4：RR-15m
08-XA3-5：RR-27m
08-XA3-6：归纳回味4m
08-XA4-1：以曲为直1m
08-XA4-2：算法框架3m
08-XA4-3：双黑缺陷2m
08-XA4-4：BB-13m
08-XA4-5：反观回味2m
08-XA4-6：BB-2R4m
08-XA4-7：BB-2B3m
08-XA4-8：BB-33m
08-XA4-9：归纳体味5m
15 practice exercises
算法框架 QUIZ3m
分裂到根 QUIZ2m
算法框架 QUIZ2m
实例演示 QUIZ2m
观察体验 QUIZ2m
O(1)重构 QUIZ3m
定义规则 QUIZ3m
红黒树，即是B-树 QUIZ2m
平衡性 QUIZ3m
双红缺陷 QUIZ2m
RR-2 QUIZ3m
伸展树20m
B-树12m
红黑树15m
平衡搜索树综合8m
4 hours to complete
第九章 词典
本章内容为：词典
4 hours to complete
33 videos (Total 143 min)
33 videos
09-B-2：循值访问5m
09-B-3：数组5m
09-B-4：原理4m
09-B-5：散列3m
09-B-6：冲突3m
09-C-1：冲突难免5m
09-C-2：何谓优劣2m
09-C-3：整除留余3m
09-C-4：以蝉为师6m
09-C-5：M+A+D5m
09-C-6：平方取中3m
09-C-7：折叠汇总3m
09-C-8：伪随机数3m
09-C-9：多项式4m
09-C-A：Vorldmort4m
09-C-B：DSA@THU2m
09-D1-1：一山二虎4m
09-D1-2：泾渭分明5m
09-D1-3：开放定址4m
09-D1-4：线性试探5m
09-D1-5：懒惰删除3m
09-D2-1：平方试探3m
09-D2-2：一利一弊3m
09-D2-3：至多半载4m
09-D2-4：M + Lemda3m
09-D2-5：双蜓点水6m
09-D2-6：4k + 32m
09-D2-7：双平方定理4m
09-D2-8：泾渭分明3m
09-E-1：大数据 + 小范围4m
09-E-2：桶排序5m
09-E-3：计数排序5m
16 practice exercises
从服务到电话 QUIZ3m
原理 QUIZ3m
冲突 QUIZ3m
冲突难免 QUIZ2m
整除留余 QUIZ3m
M+A+D QUIZ3m
多项式 QUIZ2m
DSA@THU QUIZ1m
泾渭分明 QUIZ2m
线性试探 QUIZ3m
平方试探 QUIZ3m
至多半载 QUIZ3m
计数排序 QUIZ3m
散列函数15m
排解冲突15m
桶/计数排序6m
About the Data Structures and Algorithms Specialization
Data structures play a central role in computer science and are the cornerstones of efficient algorithms. This specialization explores the principles and methods in the design and implementation of various data structures. You will learn the essential skills for algorithm design and performance analysis. Topics covered by this specialization range from fundamental data structures to recent research results.
Frequently Asked Questions
When will I have access to the lectures and assignments?
Once you enroll for a Certificate, you’ll have access to all videos, quizzes, and programming assignments (if applicable). Peer review assignments can only be submitted and reviewed once your session has begun. If you choose to explore the course without purchasing, you may not be able to access certain assignments.
What will I get if I subscribe to this Specialization?
When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.
What is the refund policy?
Is financial aid available?
More questions? Visit the Learner Help Center.