balanced binary search trees fig splay tree left-right rotate do after the rotate operations depicted in figs and the subtree rooted at the child appears to be more balanced than before those rotations notice that doing left-right rotation is not the same as doing left rotation followed by right rotation the splay left-right rotate yields different result likewisethe splay right-left rotate yields different result than right followed by left rotation splay zig-zag rotates are designed this way to help balance they tree figures and depict trees that might be slightly out of balance before the rotationbrought into much better balance by the right-left rotation or the left-right rotation iterative splaying each time value is inserted or looked up it is splayed to the root of the splay tree through series of rotations as described in the previous section the double rotation operations will either move the value to the root or the child of the root of the tree if the double rotates result in the newly inserted value at the child of the root of the treea single rotate is used to move the newly inserted value to the root as depicted in fig when and are inserted into the splay tree this copy belongs to 'acha