What is a computational complexity of queuing nearest point?

[ababo]

For unknown reason the kdtree-rs library takes about 1000x more time than Python's sklearn.neighbors.KDTree for very large datasets (like several millions of points). Can you confirm we have O(log(n)) for the nearest point query?

[alvarozamora]

kiddo does a comparison between kd-tree's implementation and their own. they have plots of the results which you can inspect

[ababo]

I did use it wrong, closing the issue.