Data structurecore
2-3 tree
Also called 2,3-tree.
A perfectly balanced search tree whose internal nodes have 2 or 3 children, with all leaves at the same depth.
A perfectly balanced search tree whose internal nodes have 2 or 3 children, with all leaves at the same depth.
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 3W4BM4 Edit this page History Report an error