Linear Data Structures
Arrays, lists, stacks, and queues.
View linear index →Computing Canon
Foundational structures for organizing data, understanding invariants, and choosing the right trade-offs in real systems.
No entries yet. Start with arrays, stacks, and hash tables.
Arrays, lists, stacks, and queues.
View linear index →Trees and hierarchical indexing.
View hierarchical index →Graphs, adjacency structures, and network models.
View graph-based index →Hash tables, maps, and key-value access.
View associative index →Heaps, priority queues, and ordered sets.
View priority index →Spatial indexing and geometric queries.
View spatial index →Approximate membership and counting.
View probabilistic index →Versioned and structural sharing patterns.
View persistent index →Thread-safe, lock-free, and wait-free structures.
View concurrent index →Domain-specific or hybrid structures.
View specialized index →