main page — CS 210 Algorithms and Data Structures
Unit 9: Suchbäume
This unit covers fundamental dynamic list data structures:
- binary heaps
- binary search trees
- 2-3 trees
- red-black trees
Material
- slides
- Animationen:
- Video 9-1 (2026-06-10, 7:53):
(Ordered) Symbol Tables
- Video 9-2 (2026-06-15, 16:02):
Symbol Table Java Konventionen
- Video 9-3 (2026-06-15, 8:10):
Elementare Symbol Tables
- Video 9-4 (2026-06-15, 16:50):
Binäre Heaps
- Video 9-5 (2026-06-15, 20:46):
Operationen in Binären Heaps
- Video 9-6 (2026-06-15, 9:15):
Binäre Suchbäume
- Video 9-7 (2026-06-17, 27:11):
Einfügen und Löschen in BSTs
- Video 9-8 (2026-06-17, 23:20):
Ordered Symbol Table Operations in BSTs
- Video 9-9 (2026-06-17, 15:39):
2-3-Bäume
- Video 9-10 (2026-06-17, 5:36):
Rot-Schwarz-Bäume
- Video 9-11 (2026-06-22, 44:17):
Red-Black Trees Operations
- Video 9-12 (2026-06-22, 26:43):
Löschen in 2-3 Bäumen
- Video 9-13 (2026-06-22, 4:30):
Überblick B-Bäume
Further sources
This unit mostly follows
- Sedgewick & Wayne, Algorithms, 4th Edition
There are many websites with animations of data structures; a particularly nice for classic data structures is
However, there seems nothing around using precisely the implementation of left-leaning red-black trees (or 2-3 trees) from
hence the new one linked above.