Creation of the KD-Tree isn't strictly O(n log (n)), but is similar O(n log (n)) in practice. It abuses Python's native sort (TimSort) which is O(n) for nearly sorted lists. Adding too many points ...

Learn how heap sort works, what are its pros and cons, and how you can implement it in Python using the heapq module. Heap sort is a fast and efficient sorting algorithm that uses a heap structure.