 Splaying the tree for a certain element rearranges the tree so that the element is placed at the root of the tree.One way to do this with the basic search operation is to first perform a standard binary tree search for the element in question, and then use tree rotations in a specific fashion to bring the element to the top.Alternatively, a top-down algorithm can combine the search and the tree reorganization into a single phase.