“…In this example, the node corresponding to the MPI_Put, ([2...12], π
ππ΄_π
πππ) is inserted in the left subtree of the node ([4], πΏππππ_π
πππ). Then, when searching for the intersecting accesses with new access ([7], πΏππππ_π πππ‘π), a new access is inserted in the BST. The algorithm works as follow: when a new access πππ€_πππ is inserted in the BST, if this πππ€_πππ is intersecting with another access π΅ππ _πππ already present in the BST, three new accesses representing the parts of the intersection of the two…”