ALGS201x: Data Structures Fundamentals - courses.edx.org
A UC San Diego Java course taught by Daniel Kane, Alexander S. Kulikov, Michael Levin, and Neil Rhodes. The accompanying textbook is Introduction to Algorithms (3rd Edition) Thomas H Cormen, MIT Press and McGraw-Hill. 2009.
They recommend taking their Algorithmic Design and Techniques.
Topics
- Aggregate Method
- Amortized Analysis
- Ancestor
- Array
- Banker's Method
- Binary Search Tree
- Breadth First Search, Breadth-First Search (BFS)
- Child
- Column-Major
- Computer Science
- Descendant
- Depth First Search, Depth-First Search (DFS)
- Doubly-Linked List, Doubly Linked List
- Dynamic Array
- Forest
- Geometric Series, Geometric Series Formula
- Hash Table
- Height
- Leaf
- Level
- Linked List
- Node
- Priority Queue
- Queue
- Physicist's Method
- Parent
- Resizable Array
- Root
- Row-Major Ordering, Row-Major Indexing
- Sibling
- Singly-Linked List, Singly Linked List
- Stack
- Syntax Tree
- Tree