MAT 3710: Data Structures
Resources
Lecture Notes
- Lesson 0: Intro to course
- Lesson 1: Java generics: Notes | Slides
- Lesson 2: Lists / Iterators
- Lesson 3: Stacks / Queues
- Lesson 4: Challenge questions / Circular queues
- Lesson 5: Circular Queues / Binary Search Trees
- Lesson 6: Trees and tree rotations
- Lesson 7: Tree theory, rotations, self-balancing trees
- Lesson 8: AVL Trees
- Lesson 9: Sets / Hashtables Intro
- Lesson 10: Hashtables / Collisions
- Lesson 11: Shortest Path Problems
- Lesson 12: Heaps (intro)
- Lesson 13: Heaps (code) + Heapsort
- Lesson 14: Heapsort / Graphs
- Lesson 15: Graphs / Shortest Paths
- Lesson 16: Topological Sorting
- Lesson 17: P vs NP