Opiniones y comentarios de aprendices correspondientes a Data Structures and Algorithms (III) por parte de Universidad Tsinghua
Acerca del Curso
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 de 2 revisiones para Data Structures and Algorithms (III)