Datenstrukturen (EN)

Concept

Organizational forms for storing and managing data

Architecture

flowchart TD   A[Array] -->|Direct access| B[O(1) access]   C[List] -->|Dynamic size| D[O(1) insertion/deletion]   E[Map] -->|Key-value| F[O(1) average]   G[Tree] -->|Hierarchical| H[O(log n) search]   I[Graph] -->|Network| J[Shortest paths]   K[Stack] -->|LIFO| L[O(1) push/pop]   M[Queue] -->|FIFO| N[O(1) enqueue/dequeue]

In Context

  • Typically used together with algorithms to efficiently perform operations on data
  • Related to: Complexity theory, algorithm design, memory management
  • Example use: Database indexes use B-trees for fast search operations
Quelle: AI Generated