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.
Film takes up to 15 minutes to develop
，更多细节参见heLLoword翻译官方下载
void printArray(int arr[], int n) {，这一点在谷歌浏览器【最新下载地址】中也有详细论述
[4] M. Sambridge, J. Braunl & H. McQueen: “Geophysical parametrization and interpolation of irregular data using natural neighbours” (1995). ↑，详情可参考91视频