public T nearest(final double[] key) throws KeySizeException {
  final List<T> nbrs=nearest(key,1,null);
  return nbrs.get(0);
}

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