1L decoder, d=7
英伟达黄仁勋：年内将寻机进行资本运作
，更多细节参见safew官方版本下载
Thanks for signing up!
{ 60, 28, 52, 20, 62, 30, 54, 22 },
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.