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
Offered By


About this Course
Basic Computer Science and programming skills
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
Basic Computer Science and programming skills
Offered by

Tsinghua University
Free online courses from Tsinghua University
Syllabus - What you will learn from this course
第零章
第八章 高级搜索树(上)
本章内容为:高级搜索树
第八章 高级搜索树(下)
本章内容为:高级搜索树
第九章 词典
本章内容为:词典
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?
What will I get if I subscribe to this Specialization?
Is financial aid available?
Will I earn university credit for completing the Course?
More questions? Visit the Learner Help Center.