Data structurecore
Persistent binary search tree
Also called persistent BST, functional binary search tree.
A binary search tree updated by path copying, so each insert or delete yields a new root with O(log n) new nodes when balanced.
A binary search tree updated by path copying, so each insert or delete yields a new root with O(log n) new nodes when balanced.
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 F9C8A3 Edit this page History Report an error