Data structurecore
Left-child right-sibling representation
Also called first-child next-sibling, child-sibling representation.
Rooted tree stored with two pointers per node: first child and next sibling.
Rooted tree stored with two pointers per node: first child and next sibling.
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 NWHW83 Edit this page History Report an error