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.
米哈游多款未公开角色遭泄露，3名“00后”被刑拘，更多细节参见服务器推荐
Цены на нефть взлетели до максимума за полгода17:55，推荐阅读51吃瓜获取更多信息
第一百一十九条 违反治安管理行为事实清楚，证据确凿，处警告或者五百元以下罚款的，可以当场作出治安管理处罚决定。
Prompt 版本化（像代码一样管理）