Data structureadvanced
Finger search tree
Also called finger tree.
Search tree where a search from a stored finger costs time logarithmic in the distance to the target.
Search tree where a search from a stored finger costs time logarithmic in the distance to the target.
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 X7SV6M Edit this page History Report an error