trees figure result of splaying the previous tree at node figure result of splaying the previous tree at node figure result of splaying the previous tree at node we can perform deletion by accessing the node to be deleted this puts the node at the root if it is deletedwe get two subtrees tl and tr (left and rightif we find the largest element in tl (which is easy)then this element is rotated to the root of tl and tl will now have root with no right child we can finish the deletion by making tr the right child