How information is shaped, stored, and connected in memory.
Contiguous memory, O(1) random access.
Nodes chained by pointers, O(1) splices.
Two-way pointers for O(1) backward traversal.
Last-In-First-Out. Push, pop, peek.
First-In-First-Out. Enqueue, dequeue.
Key → bucket via a hash function. O(1) average.
Left < node < right. Ordered O(log n) search.
Complete binary tree; root is always min/max.
Shared-prefix tree for fast string lookup.
Nodes and edges modeling any relationship.
Near-constant merge & connectivity checks.