e/BK-tree

Information
has gloss	eng: A BK-tree is a metric tree suggested by Burkhard and Keller specifically adapted to discrete metric spaces. For simplicity, let us consider integer discrete metric \varrho(x,y). Then, BK-tree is defined in the following way. An arbitrary element a is selected as root node. Root node may have zero or more subtrees. The k-th subtree is recursively built of all elements b such that \varrho(a,b) = k. BK-trees can be used for approximate string matching in a dictionary .
lexicalization	eng: Bk tree
lexicalization	eng: Bk-tree
instance of	e/Tree (data structure)