main page — CS 210 Algorithms and Data Structures
Unit 8: Dynamische Listen
This unit covers fundamental dynamic list data structures:
- singly linked lists
- doubly linked lists
- stacks and queues
- iterators
- doubling arrays
- amortized analysis
Material
- slides
- PythonTutor animations
- Video 8-1 (2026-06-03, 16:36):
Abstract Data Types & Collections
- Video 8-2 (2026-06-03, 25:10):
Lineare Listen
- Video 8-3 (2026-06-08, 9:40):
Stacks und Queues
- Video 8-4 (2026-06-08, 34:13):
Array-basierte Listen
- Video 8-5 (2026-06-08, 33:44):
Einfach verkettete Listen
- Video 8-6 (2026-06-10, 4:54):
Einfach verkettete Liste PythonTutor Visualisierung
- Video 8-7 (2026-06-10, 19:40):
Doppelt verkettete Liste
- Video 8-8 (2026-06-10, 28:21):
Dynamische Arrays
- Video 8-9 (2026-06-10, 14:36):
Java Collections Framework
Further sources
This unit closely follows Chapter 2 of
The stack and queue discussion also takes inspiration from
- Sedgewick & Wayne, Algorithms, 4th Edition
A decent overview of the Java Collections Framework is given in the Wikipedia article.