Data Structures
The core containers every engineer must know cold. Each component below has detailed explanations covering how it works, its complexity, and when to reach for it.
Components
Pick a structure to study. Every page has layered explanations covering how it works, its complexity, and when to reach for it.
Array
Contiguous, index-addressable storage; the foundation of most structures.
String
Sequences of characters, immutability, and common operations.
Linked List
Nodes linked by pointers; singly, doubly, and circular variants.
Stack
LIFO structure for undo, recursion, and expression parsing.
Queue
FIFO structure; deques, circular buffers, and priority queues.
Hash Table
Key→value in average O(1); hashing, collisions, and load factor.
Tree / BST
Hierarchies and ordered search trees, balancing, traversals.
Heap
Complete binary tree for fast min/max; the priority queue engine.
Graph
Vertices and edges; representations and traversal (BFS/DFS).
Trie
Prefix tree for fast string lookup and autocomplete.