Data structureadvanced
M-tree
Also called metric tree, metric tree M-tree.
Balanced metric-space tree that stores covering balls and supports dynamic insertion.
Balanced metric-space tree that stores covering balls and supports dynamic insertion.
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 GE79TV Edit this page History Report an error