Definitionintro
Complete binary tree
A binary tree in which every level is full except possibly the last, which is filled from left to right.
A binary tree in which every level is full except possibly the last, which is filled from left to right.
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 VZ3WQZ Edit this page History Report an error