Learner reviews & feedback for Data Structures and Algorithms (III)

0.00

About this 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.

cornell

5.0

Reviewed Sep 6, 2020

One of the best DSA courses in China

Heng Joon Tiang

4.0

Reviewed Nov 11, 2022

Tsinghua algorithm courses covers the more advanced data structures in a very lucid manner, enhancing better understanding and appreciation for things being done in a particular manner. Appreciate the course a lot, as it helps me gain a better understanding of more advanced data structures not found elsewhere.

The questions are not easy either, especially the programming questions. This is excaberbated by not being able to use existing adts provided as is from c++, but we need to code our own vectors , and so on. However after we have succeeded in completing the course, the skill level would definitely soar.

Highly recommended for those wanting to up their skillsets,and have a greater understanding!