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

• lecture notes

• Animationen:
  • Left-leaning red-black trees
     
• Video 9-1 (2026-06-10): (Ordered) Symbol Tables

• Video 9-2 (2026-06-15): Symbol Table Java Konventionen

• Video 9-3 (2026-06-15): Elementare Symbol Tables

• Video 9-4 (2026-06-15): Binäre Heaps

• Video 9-5 (2026-06-15): Operationen in Binären Heaps

• Video 9-5 (2026-06-15): Binäre Suchbä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

• Kováč et al. Gnarley Trees

However, there seems nothing around using precisely the implementation of left-leaning red-black trees (or 2-3 trees) from

• Sedgewick, Left-Leaning Red-Black Trees, 2008

hence the new one linked above.

---

Unit 8  ⋅  Syllabus  ⋅  Unit 10