dean cluster he data node in the children ea direction. E exactly on point into find its dir with the m and center node. If a p the tree an direction o has a point becomes a inherits its Then the previous point it had and the new point are the new children. This process repeats itself until the left to be inserted. It uses O(n logn) time.