Algorithm Search⌘K

Data structureadvanced

Persistent segment tree

Also called versioned segment tree, persistent range tree.

A segment tree that stores each update as O(log n) new nodes, so queries on any past version run in O(log n).

A segment tree that stores each update as O(log n) new nodes, so queries on any past version run in O(log n).

About this page

The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.

LadderLevelWhat the next level needs
Human proofH0 no proof
  • add a proof in proofs/ (06.5)
LeanL0 no Lean part
  • name a Lean module in the lean field (07)
VisualV0 none
  • add viz/scene.ts or a figure (10)
WritingW0 stub
  • The abstract type
  • one source with a locator