Coursera
Coursera Logo

Data Structures and Algorithms (III) 

  • Offered byCoursera

Data Structures and Algorithms (III)
 at 
Coursera 
Overview

Duration

27 hours

Total fee

Free

Mode of learning

Online

Official Website

Explore Free Course External Link Icon

Credential

Certificate

Data Structures and Algorithms (III)
Table of content
Accordion Icon V3
  • Overview
  • Highlights
  • Course Details
  • Curriculum
  • Student Reviews

Data Structures and Algorithms (III)
 at 
Coursera 
Highlights

  • Earn a Certificate upon completion from Tsinghua University
Details Icon

Data Structures and Algorithms (III)
 at 
Coursera 
Course details

More about this course
  • Get a comprehensive grasp of hashing and typical balanced binary search trees, as well as their applications
  • 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

Data Structures and Algorithms (III)
 at 
Coursera 
Curriculum

Other courses offered by Coursera

– / –
3 months
Beginner
– / –
20 hours
Beginner
– / –
2 months
Beginner
– / –
3 months
Beginner
View Other 6726 CoursesRight Arrow Icon

Data Structures and Algorithms (III)
 at 
Coursera 
Students Ratings & Reviews

4/5
Verified Icon1 Rating
P
Pavan Kumar Dhulipalla
Data Structures and Algorithms (III)
Offered by Coursera
4
Learning Experience: It's very good and useful to learn in coursera as it has many weekly assessment and very good way of teaching. Really very nice experience.
Faculty: The way of explanation of faculty I'd very good The curriculum structure was nice and it's very structured.
Course Support: Provided project suggestions on DSA and problem solving ability
Reviewed on 28 Oct 2022Read More
Thumbs Up IconThumbs Down Icon
View 1 ReviewRight Arrow Icon
qna

Data Structures and Algorithms (III)
 at 
Coursera 

Student Forum

chatAnything you would want to ask experts?
Write here...