The tree starts as a single region covering the whole space. As points arrive, they get dropped into the region that contains them. When a region exceeds its capacity (the maximum number of points it can hold before splitting), the region divides into four children, and the existing points get redistributed.
圖像來源，Getty Images，推荐阅读快连下载-Letsvpn下载获取更多信息
Follow topics & set alerts with myFT，推荐阅读搜狗输入法2026获取更多信息
Async iteration (8KB × 1000)