Java programming help: Implement a function, getNeighbors(), in KDtree.java for finding neighbors in a K-D tree. The function takes two parameters: a query key (multidimensional), and the distance cutoff (r) that is used to define neighbors. Function reports all records that are within distance r of the query point. Test your function with two-dimensional keys, which are already implemented in KDtreeTest.java.

KDtree.java: http://pastebin.com/Qrh3gJZ6

BinNode: http://pastebin.com/u6iAtmzW