question: public T nearest ( final double [ ] key ) throws KeySizeException { final List < T > nbrs = nearest ( key , 1 , null ) ; return nbrs . get ( 0 ) ; }
target:  Find KD-tree node whose key is nearest neighbor to key.