The B-K tree structure.

A node in the B-K tree.

Adds a node (i.e. Node{T}(item::T)) to the tree.

Find items in the tree whose distance is less or equal to n and returns the top k items, ordered ascending according to the distance.

Calculates the Hamming distance (numbers of different bits) between two numbers.

Determines whether a Node in the BKTree is empty or not.