* 时间复杂度: O(nlogn) 空间复杂度: O(n) 稳定: ✓
Жители Санкт-Петербурга устроили «крысогон»17:52
，更多细节参见下载安装汽水音乐
Филолог заявил о массовой отмене обращения на «вы» с большой буквы09:36
The quadtree is the two-dimensional case of a broader family of space-partitioning data structures. Octrees extend the same idea to three dimensions (splitting cubes into eight children), KD-trees use alternating axis-aligned splits (splitting along x, then y, then x again), and R-trees group nearby objects into bounding rectangles. Each variant makes different tradeoffs between construction time, query speed, and update cost.