Graph Structures
Adjacency matrices, adjacency lists, topological sort and union-find: how a graph is stored decides which algorithm is cheap.
Adjacency matrices, adjacency lists, topological sort and union-find: how a graph is stored decides which algorithm is cheap.
Arrays, linked lists, stacks, queues and hash tables: the storage trade-offs behind every collection API.
Binary trees, red-black trees, B-trees, B+ trees and heaps: the balance and fan-out choices behind ordered data.