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.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag KB52KZ Edit this page History Report an error