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
2,846 already enrolled
Offered By


About this Course
Flexible deadlines
Reset deadlines in accordance to your schedule.
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Course 3 of 4 in the
Intermediate Level
Basic Computer Science and programming skills
Approx. 26 hours to complete
Chinese (Simplified)
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
Flexible deadlines
Reset deadlines in accordance to your schedule.
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Course 3 of 4 in the
Intermediate Level
Basic Computer Science and programming skills
Approx. 26 hours to complete
Chinese (Simplified)
Offered by
Syllabus - What you will learn from this course
1 hour to complete
第零章
1 hour to complete
5 readings
5 hours to complete
第八章 高级搜索树(上)
5 hours to complete
41 videos (Total 140 min)
7 hours to complete
第八章 高级搜索树(下)
7 hours to complete
36 videos (Total 145 min)
5 hours to complete
第九章 词典
5 hours to complete
33 videos (Total 143 min)
About the Data Structures and Algorithms Specialization

Frequently Asked Questions
When will I have access to the lectures and assignments?
What will I get if I subscribe to this Specialization?
Is financial aid available?
More questions? Visit the Learner Help Center.