Data structureadvanced
k-d-B tree
Also called k-d-B-tree, KDB tree.
Disk-oriented hybrid of the k-d tree and the B-tree in which all leaves are at the same depth.
Disk-oriented hybrid of the k-d tree and the B-tree in which all leaves are 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 TMRMPW Edit this page History Report an error