int range = max - min + 1; // 数据范围
The algorithm also visits children in order of distance to the query point. This means it checks the most promising quadrants first, which tends to find a good candidate early and enables aggressive pruning of the remaining quadrants. Without this ordering, the algorithm would still produce the correct result, but it would prune fewer nodes.
，详情可参考WPS下载最新地址
Space exploration
a CAS to push entries onto the free list is worth experimenting with.