In this case, it is necessary to find the predecessor of the least common ancestor of the query point and the leaf found.
U ovom slučaju neophpdno je pronaći prethodnika najmanje zajedničkog pretka upitne tačke i pronađenog lista.