If B is an internal node, call the algorithm recursively on B's two children, searching the child whose center is closer to t first.
Ako je B unutrašnji čvor, pozovi algoritam rekurzivno za decu čvora B, tražeci dete čiji je centar bliži tacki t.