Data Structures and Algorithms (III)

Description

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.


Read more.

Career Relevance by Data Role

The techniques and tools covered in Data Structures and Algorithms (III) are most similar to the requirements found in Data Scientist job advertisements.


Similarity Scores (Out of 100)

Subscribe for updates and new courses
Or create a DataKwery.com account
Fast Facts
Techniques
AlgorithmsData AnalysisDecision Trees

Similar Opportunities
Data Structures Fundamentals

edX - University of California, San Diego

Advanced Data Structures

edX - New York University

Data Structures and Algorithms (II)

Coursera - Tsinghua University

Algorithms, Part I

Coursera - Princeton University

Graph Algorithms in Genome Sequencing

edX - University of California, San Diego

Ordered Data Structures

Coursera - University of Illinois at Urbana-Champaign