Check the operation boundary before the asymptotic claim. Range additions touch two differences, inclusion proofs need a trusted root, and append-only heaps keep every count.
Lessons
- Two Fenwick trees: add across ranges and query sums
- Merkle trees: verify an indexed scan record
- Two heaps: maintain an exact running median