A metric tree is any tree data structure specialized to index data in metric spaces. Metric trees exploit properties of metric spaces such as the triangle inequality to make accesses to the data more efficient. Examples include the M-tree, vp-trees, cover trees, MVP Trees, and bk trees.
Read more about Metric Tree: Multidimensional Search, Metric Data Structures
Famous quotes containing the word tree:
“A tree there is that from its topmost bough
Is half all glittering flame and half all green
Abounding foliage moistened with the dew;
And half is half and yet is all the scene;
And half and half consume what they renew....”
—William Butler Yeats (1865–1939)