Tony Jolliffe/BBC News
Style: Augmented reality smart glasses
，详情可参考WPS官方版本下载
Now that we can build the tree, let's use it to search. Finding a specific point means starting at the root and asking: which child quadrant contains this coordinate? Then you recurse into that child and ask again. Each level of the tree cuts the search space by roughly three-quarters.
for (let i = 0; i < n; i++) {