Learn Data Structures in German: 95 Flashcards from Stapel to B-Baum

This is the German edition of our 95-card data structures deck: the fronts stay in English, the backs are written in German. That makes GL1725 — Datenstrukturen two things at once — a computer science deck and a technical glossary for anyone heading to a German university, a German-speaking dev team, or a Klausur in Algorithmen und Datenstrukturen. If you want the English walkthrough, read the English Data Structures guide first; this page covers what changes in German.

Was die Karten wirklich sagen

Also in the deck: abstrakter Datentyp (ADT), Array, verkettete Liste (einfach, doppelt, zirkulär), Record/Struct, Hash-Tabelle, Graph (gerichtet, ungerichtet, gewichtet, DAG, Zyklus, Spannbaum), Breitensuche und Tiefensuche, Deque, Prioritätswarteschlange, Baum, Wurzel, Blatt, Binärbaum, B-Baum, Heap, Trie, Zeiger, Set, Multiset, Dictionary, Adjazenzmatrix, opaker Datentyp, nebenläufige Datenstruktur, Succinct-Strukturen, räumliche Lokalität, Big-O-Notation, Höhe und Tiefe eines Knotens, C++ STL, Java Collections Framework and Knuth's The Art of Computer Programming.

Der Fachwortschatz, den das Deck nicht zeigt

The backs mostly keep English loanwords (Stack, Queue, Heap, Push, Pop). Real German lecture notes often don't, so add these as hints:

• Stack = Stapel or Kellerspeicher (the classic term from Bauer and Samelson, who patented the stack principle in 1957).
• Queue = Warteschlange — the deck uses it, but only inside the definitions.
• Heap = Halde in older textbooks.
• Array = Feld. This is the trap: card 13 translates record fields as Felder, while many German professors say Feld for an array. Write "Feld (Array) ≠ Feld eines Records (Komponente)" on that card.

Drei Korrekturen vor der ersten Runde

1. Card 15 gives hash-table access as O(1) without the caveat: that's the average case; with many collisions the worst case is O(n).
2. Card 65 gives BST operations as O(log n) "im Durchschnitt" — add that a degenerate tree (sorted inserts) falls to O(n). That's exactly why cards 35 and 88 (AVL, self-balancing trees) exist; review the three together.
3. Card 39 says relational databases index with a B-Baum. In practice it's almost always the B⁺-Baum variant (data only in the leaves, linked leaf level).

Reihenfolge

Cards 1–51 follow an encyclopedia overview; cards 52–95 are a glossary that re-defines several earlier terms. Suspend the duplicates — card 93 (leaf node) repeats 32, card 25 repeats 22, card 29 repeats 26, card 54 repeats 7 — and study the glossary's traversal and graph cards (71–85) together with the trees section, not at the end.

The deck is GL1725 — Datenstrukturen (95 cards); search the code in your library at flip-it.app.