Prefix sums that survive updates: a binary indexed tree adds and sums in O(log n) by following the lowest set bit of an index.
This interactive visualization needs JavaScript.