4 docs tagged with "range queries"

This post covers dynamic segment trees, their use-cases, code examples, and how they differ from regular segment trees.

A Persistent Segment Tree keeps every previous version of itself accessible after an update, enabling efficient queries on historical states of an array.

Segment Trees are used for efficient range queries.

Sqrt Decomposition is a technique that splits an array into blocks of size sqrt(n) to answer range queries and updates faster than brute force.