# If a kNN ($k$ Nearest Neighbors) Algorithm Performs Very Well for Low $k$, Can Something be Inferred About the Data Set?

I am running kNN on a very small data set for binary classification. Each class has 100 samples. I am getting the best performances for $$k=1$$ and $$k=3$$. Can I deduce information about my data set from kNN performing very well for small values of $$k$$?