Data structurecore
Persistent red-black tree
Also called Okasaki red-black tree, functional red-black tree.
A red-black tree with a purely functional balance step, giving O(log n) persistent insert and delete.
A red-black tree with a purely functional balance step, giving O(log n) persistent insert and delete.
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 3F3XMG Edit this page History Report an error