A student claims: “An R-tree is basically a B+Tree for recta…
A student claims: “An R-tree is basically a B+Tree for rectangles. For a point lookup, we follow exactly one path from the root to a leaf, just like in a B+Tree, because at each level we can choose the single child whose bounding box contains the point.”Which statement about search behavior in R-trees versus B+Trees is NOT correct?