Data structureresearch
Cover tree
Also called Beygelzimer cover tree, cover tree.
Leveled metric tree with provable query bounds depending on the expansion constant of the data.
Leveled metric tree with provable query bounds depending on the expansion constant of the data.
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 GE45W4 Edit this page History Report an error