* 核心思路：链表转数组 + 单调栈（从后往前遍历），时间复杂度O(n)，空间复杂度O(n)
露西·吉爾德（Lucy Gilder），BBC事實查核
，更多细节参见safew官方版本下载
The algorithm maintains a running "best distance" that starts at infinity. As it walks the tree, it checks each visited point and updates the best distance if it finds something closer. Before recursing into a child node, it checks whether the closest possible point in that child's bounding box is farther than the current best. If so, the entire subtree gets pruned.
[&:first-child]:overflow-hidden [&:first-child]:max-h-full"
人 民 网 版 权 所 有 ，未 经 书 面 授 权 禁 止 使 用