Notice how the highlighted region shrinks at each step. The algorithm never examines points outside the narrowing window. In a balanced tree with nnn points, this takes about log4(n)\log_4(n)log4(n) steps. For a million points, that's roughly 10 steps instead of a million comparisons.
What Went Wrong，详情可参考爱思助手下载最新版本
Working parents，这一点在Line官方版本下载中也有详细论述
10 additional monthly gift articles to share。safew官方版本下载对此有专业解读