Sqrt Tree — √n-Depth Range Queries

Why it matters

Sqrt tree offers different trade-offs than sparse table.

The architecture

Recursive √n block structure.

Precompute answers at multiple levels.

How it works end to end

Supports: idempotent operations (min, max, gcd) + associative (sum).

Update: recompute affected blocks.

Alternative: sparse table for immutable idempotent.