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.
Class Deals by MOOC List - Click here and see Coursera's Active Discounts, Deals, and Promo Codes.
Course 2 of 3 in the Accelerated Computer Science Fundamentals Specialization.
Course Syllabus
Week 1: Orientation; Linear Structures
Week 2: Introduction to Tree Structures
Week 3: Advanced Tree Structures
Week 4: Heap Structures