Implemented basic k-DTree data structure. Main feature, searching
of nearest neighbor is not implemented yet.
The three can be constructed from provided vectors.
This is improvet variant of the tree present in the paper:

'An Algorithm for Finding Best Matches in Logarithmic Expected Time'