Lazy data structures
Kent Quanrud · 96:17
Amortized analysis lets you keep worst-case inputs while charging expensive operations across a whole sequence, so very simple structures—binary increment, doubling arrays, lazily rebuilt search trees, and two-stack q...