Write down a sequence of numbers in the order that the k$-$d tree is traversed when checking

intersections between a ray and the scene. Every non$-$leaf node can be thought of as implicitly

generating a splitting hyperplane that divides the space into two bounding boxes. The numbers at the

leaf nodes represents the intersection test between the ray and the primitives. The number at the arrow

represents the intersection test between the ray and the bounding box. Omit numbers that correspond to

pruned operations $($that is not executed$).$ Do not exclude intersection tests that fails; for example, the

correct answer is $1$ for a ray that doesn't collide with the outer$-$most bounding box.

Ray $1$:

Ray $2$