Data structureadvanced
Persistent treap
Also called persistent randomized BST.
A treap updated by path copying, whose expected O(log n) depth holds for each version.
A treap updated by path copying, whose expected O(log n) depth holds for each version.
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 XM4DVE Edit this page History Report an error