A BK-tree library in Java that implements Set.
A BK-tree is a search tree that is optimized for nearest neighbor searches with O(log N) time complexity through a metric space. The edges of the tree are indexed by the distance between the parent and the child, based on a distance function, also known as a metric.
Also included are implementations of the Levenshtein distance function and Hamming distance function.
Inspired by the post by Michele Lacchia. Licensed under the MIT License.