The algorithm walks the tree recursively. At each node, it checks: does this node's bounding box overlap with the query rectangle? If not, the entire subtree gets pruned (skipped). If it does overlap, it tests the node's points against the query and recurses into the children.
Овечкин продлил безголевую серию в составе Вашингтона09:40
，推荐阅读WPS官方版本下载获取更多信息
Карина Черных (Редактор отдела «Ценности»)
Фото: Yves Herman / Reuters