Guides / data-structures

data-structures Guides

13 guides

beginner

Contiguous, index-based collections with fast random access

Networks of nodes and edges modeling relationships

Key-value storage with average O(1) lookup and insertion

Priority-ordered trees for fast access to the smallest item

Node-based sequences with cheap inserts and removals

First-in, first-out structure for fair, ordered processing

Last-in, first-out structure for ordered processing

Hierarchical node structures like binary search trees

Choosing between adjacency lists and matrices to store graph edges

Queues that serve the highest-priority element first, backed by a heap

Prefix trees that store strings by shared character paths for fast lookups

Self-balancing search trees that guarantee logarithmic operations

Disjoint-set structure for tracking connected groups with near-constant merges