Save for later
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解决各种问题,例如范围查询。
Get a Reminder
Rating | Not enough ratings |
---|---|
Length | 6 weeks |
Starts | Jul 3 (46 weeks ago) |
Cost | $49 |
From | Tsinghua University via Coursera |
Instructor | Junhui Deng |
Download Videos | On all desktop and mobile devices |
Language | Chinese |
Subjects | Programming |
Tags | Computer Science Algorithms |
Get a Reminder
Similar Courses
Careers
An overview of related careers and their average salaries in the US. Bars indicate income percentile.
Technical Track Typical Analyst Lead $83k
Technical Track Typical Analyst Lead $83k
Write a review
Your opinion matters. Tell us what you think.
Please login to leave a review
Rating | Not enough ratings |
---|---|
Length | 6 weeks |
Starts | Jul 3 (46 weeks ago) |
Cost | $49 |
From | Tsinghua University via Coursera |
Instructor | Junhui Deng |
Download Videos | On all desktop and mobile devices |
Language | Chinese |
Subjects | Programming |
Tags | Computer Science Algorithms |
Similar Courses
Sorted by relevance
Like this course?
Here's what to do next:
- Save this course for later
- Get more details from the course provider
- Enroll in this course