Guides / data-structures

data-structures Guides

13 guides

beginner

Arrays

Contiguous, index-based collections with fast random access

Graphs

Networks of nodes and edges modeling relationships

Hash Tables

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

Heaps

Priority-ordered trees for fast access to the smallest item

Linked Lists

Node-based sequences with cheap inserts and removals

Queues

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

Stacks

Last-in, first-out structure for ordered processing

Trees

Hierarchical node structures like binary search trees

intermediate

Graph Representation

Choosing between adjacency lists and matrices to store graph edges

Priority Queues

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

Tries

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

advanced

Balanced Trees

Self-balancing search trees that guarantee logarithmic operations

Union-Find

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