Data structureadvanced
Finger tree
Also called Hinze-Paterson finger tree.
A persistent balanced sequence with amortized O(1) access at both ends and O(log n) split and concatenation.
A persistent balanced sequence with amortized O(1) access at both ends and O(log n) split and concatenation.
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 BJ50ZK Edit this page History Report an error