Data structureintro
B*-tree
B+ tree variant that keeps nodes at least two-thirds full by redistributing keys with siblings.
B+ tree variant that keeps nodes at least two-thirds full by redistributing keys with siblings.
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 FES1ZP Edit this page History Report an error