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
About this Course
Syllabus - What you will learn from this course
Orientation; Linear Structures
Introduction to Tree Structures
Advanced Tree Structures
- 5 stars83.75%
- 4 stars12.72%
- 3 stars2.30%
- 2 stars0.72%
- 1 star0.48%
TOP REVIEWS FROM ORDERED DATA STRUCTURES
The material covered is explained very well, but it feels like these UIUC courses are light in terms of total material per course.
Good quick introduction to ordered data structures. I think this course be well served with a bit more theory explaining the big O justifications.
Really good course so far. Using VSC + git bash on a Windows 10 machine for the programming assignments, and the web-based compiler for the challenges. Really good experiences so far.
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.
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.