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.
Only available as a Lego Insiders Reward
。heLLoword翻译官方下载对此有专业解读
18:43, 27 февраля 2026Силовые структуры
Try it yourself
Standard Digital