Data structurecore
Skip list
A randomized ordered dictionary made of layered linked lists, where higher layers skip over elements, giving expected logarithmic search, insertion and deletion.
A randomized ordered dictionary made of layered linked lists, where higher layers skip over elements, giving expected logarithmic search, insertion and deletion.
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 XYVYKG Edit this page History Report an error