This node constructs a KD Tree from the input vector list.
KD Trees is a space-partitioning data structure that can be used in multiple spatial searching applications like:
This data structure is used instead of a traditional nearest neighbor
search because it is tremendously faster having a time complexity of O(n) in the worst case.