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.
Overview
Syllabus
- Orientation; Linear Structures
- Introduction to Tree Structures
- Advanced Tree Structures
- Heap Structures
Taught by
Wade Fagen-Ulmschneider
