Difference between scipy.spatial.KDTree and scipy.spatial.cKDTree
In a use case (5D nearest neighbor look ups in a KDTree with approximately 100K points) cKDTree is around 12x faster than KDTree.
What is the difference between these two algorithms?