(Java) 15.15 Version

**daemoohn** · May 4, 2016, 10:35am

Hi,

I have a question regarding the proper data structure choice for this problem.
If I choose 2 tree sets, first ordered by Ox axis, second by Oy axis, insert would take O(n log n) at most. Otherwise a k-d tree would do it?

**tsunghsienlee** · October 3, 2016, 4:34am

Why your algorithm insertion needs O(nlogn) time? I think there must something wrong here. k-d tree will definitely works.