Data structureintro
Singly linked list
Also called linked list.
Nodes each holding a value and a pointer to the next node.
Nodes each holding a value and a pointer to the next node.
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 QXYA7A Edit this page History Report an error