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.
제공자:


이 강좌에 대하여
Basic Computer Science and programming skills
배울 내용
Algorithms used to solve complex problems
Principles and methods in the design and implementation of various data structures
Skills for algorithm design and performance analysis
Background on fundamental data structures and recent results
Basic Computer Science and programming skills
제공자:

칭화대학교
Free online courses from Tsinghua University
강의 계획표 - 이 강좌에서 배울 내용
第零章
第八章 高级搜索树(上)
本章内容为:高级搜索树
第八章 高级搜索树(下)
本章内容为:高级搜索树
第九章 词典
本章内容为:词典
데이터 구조 및 알고리즘 특화 과정 정보
Data structures play a central role in computer science and are the cornerstones of efficient algorithms. This specialization explores the principles and methods in the design and implementation of various data structures. You will learn the essential skills for algorithm design and performance analysis. Topics covered by this specialization range from fundamental data structures to recent research results.

자주 묻는 질문
강의 및 과제를 언제 이용할 수 있게 되나요?
이 전문 분야를 구독하면 무엇을 이용할 수 있나요?
재정 지원을 받을 수 있나요?
궁금한 점이 더 있으신가요? 학습자 도움말 센터를 방문해 보세요.