geospatial - rtree/btree data structure go upper from child to parent -

i new rtree/btree data structures. creation of tree bottom-to-up process searching node/range search/knn search top-to-bottom process. using knn search wanting improvement: data trajectory of points, spatially close each other. in order search knns every point on entire trajectory, want search 1 point first, other points, don't want start root again, instead want start results of first point, , go upper parents. enable me avoid searching lot of unnecessary pages. problem here how can go upper child parent in rtree/btree structure? should change tree creation process , whenever split happens, fill parent[] property of child? there other simpler ways problem?

you could:

1. store pointer parent node in children node know how move upwards in nodes structure. between queries store pointer last leaf node , there using pointer parent move upwards, check parent node, again move upwards etc. until node different subtree should picked.
2. store pointers children nodes in every node. between queries save whole path of nodes used root leaf in last query. having last path go backwards in collection represent going upwards leaf used in last query node should pick different subtree.