fn flatten_tree(root: RTreeNode) -> Vec<FlatNode>Expand description
Flatten an R-Tree into a contiguous Vec using BFS ordering.
BFS guarantees that all children of the same parent occupy contiguous indices, which is the key property for cache-efficient search.