<imgsrc="https://upload.wikimedia.org/wikipedia/commons/6/62/Treap_erase.svg"width="500px"/>

</center>

Implementation of**Erase ($X$)** is also clear. First we descend in the tree (as in a regular binary search tree by $X$), looking for the element we want to delete. Once the node is found, we call**Merge** onit children and put the return value of the operation in the place of the element we're deleting.

Implementation of**Erase ($X$)** is also clear. First we descend in the tree (as in a regular binary search tree by $X$), looking for the element we want to delete. Once the node is found, we call**Merge** onits children and put the return value of the operation in the place of the element we're deleting.

Alternatively, we can factor out the subtree holding $X$ with $2$ split operations and merge the remaining treaps (see the picture).