Data structureresearch
Range min-max tree
Also called RMM tree.
A tree of min and max excess values over a balanced parenthesis sequence that speeds up tree navigation queries.
A tree of min and max excess values over a balanced parenthesis sequence that speeds up tree navigation queries.
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 EHY1SS Edit this page History Report an error