balanced binary search trees would-be parent of the value if the value is not found in the tree deletion from the tree can be implemented like delete from any other binary search tree as described in problem of chap when value is deleted from binary search tree the parent of the deleted node is splayed to the root of the tree the example in fig depicts the splay operations that result from inserting the green nodes into splay tree when is insertedit is splayed to the root of the tree as appears in the second version of the tree (the red nodeswhen is insertedit is splayed to the root as well moving to the root is accomplished through zig-zig rotation called double-right rotation splaying the to the root is the result of zig-zag rotation called right-left rotation when the is splayed to the root it is double-left rotation followed by single left rotation splaying the to the root is accomplished by doing double-right rotation followed by left-right rotation the double-right is often called zig-zig rotation as is the double-left rotation the left-right and right-left rotations are often called zig-zag rotations the end result in each case has the newly inserted nodeor looked up nodesplayed to the root of the tree figures and depict these splay operations figures and give some intuitive understanding of why splay trees work as well as they fig splay tree double-right rotate this copy belongs to 'acha