Learner Reviews & Feedback for Data Structures and Algorithms (III) by Tsinghua University
About the Course
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.
1 - 2 of 2 Reviews for Data Structures and Algorithms (III)