Data structureintro
Doubly linked list
Also called two-way linked list.
Nodes with pointers to both neighbours, so a node can be unlinked in O(1).
Nodes with pointers to both neighbours, so a node can be unlinked in O(1).
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 B9V487 Edit this page History Report an error