code: def overlap(self, x, ctrs, kdtree=None):
          
  
          q = len(self.within(x, ctrs, kdtree=kdtree))
  
          return q
docs: Check how many balls `x` falls within. Uses a K-D Tree to
          perform the search if provided.