Data structurecore
k-d tree
Also called 2d-tree, k-dimensional tree, kd-tree.
Binary tree that splits k-dimensional points by cycling through the coordinate axes at each level.
Binary tree that splits k-dimensional points by cycling through the coordinate axes at each level.
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 39PCSM Edit this page History Report an error