返回到 Data Structures and Algorithms (III)
學生對 清华大学 提供的 Data Structures and Algorithms (III) 的評價和反饋
課程概述
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.
通过学习本课程，你将全面了解散列和典型的平衡二叉搜索树技术及其应用。 在本课程结束时，你将能够了解散列的原理，设计和实现用于实际问题的哈希表，了解并实现典型的平衡二叉搜索树，例如Splay树，红黑树以及B树，并使用BBST解决各种问题，例如范围查询。
篩選依據：
1 - Data Structures and Algorithms (III) 的 2 個評論（共 2 個）
創建者 cornell
•2020年9月6日
創建者 Heng J T
•2022年11月11日
Coursera Footer
© 2022 Coursera Inc.保留所有權利。
