In this course, you will learn new data structures for efficiently storing and retrieving data that is structured in an ordered sequence. Such data includes an alphabetical list of names, a family tree, a calendar of events or an inventory organized by part numbers. The specific data structures covered by this course include arrays, linked lists, queues, stacks, trees, binary trees, AVL trees, B-trees and heaps. This course also shows, through algorithm complexity analysis, how these structures enable the fastest algorithms to search and sort data.
This course is part of the Accelerated Computer Science Fundamentals Specialization
Offered By


About this Course
Could your company benefit from training employees on in-demand skills?
Try Coursera for BusinessCould your company benefit from training employees on in-demand skills?
Try Coursera for BusinessSyllabus - What you will learn from this course
Orientation; Linear Structures
Introduction to Tree Structures
Advanced Tree Structures
Heap Structures
Reviews
- 5 stars83.75%
- 4 stars12.72%
- 3 stars2.30%
- 2 stars0.72%
- 1 star0.48%
TOP REVIEWS FROM ORDERED DATA STRUCTURES
Nice course, challenging. A little bit dense and fast though. But I learned a lot of things for a person who has no computer science background.
Really good course, Makes you understand the intuition of the data structures pretty clear. The exams and assignment for week 4 seems a bit rushed, Could have been better
This is one of the best courses I have studied so far, the instructor's way is very easy to understand yet provides in-depth understanding of the material.
Good coverage. The lecturer and teaching stuff are knowledgeable and helpful. Would be better if the slides can have more details.
About the Accelerated Computer Science Fundamentals Specialization

Frequently Asked Questions
When will I have access to the lectures and assignments?
What will I get if I subscribe to this Specialization?
Is financial aid available?
More questions? Visit the Learner Help Center.