trees figure deletion of node ( with two childrenbefore and after /*internal method to remove from subtree is the item to remove is the node that roots the subtree set the new root of the subtree *void removeconst comparable xbinarynode ift =nullptr return/item not founddo nothing ifx element removext->left )else ift->element removext->right )else ift->left !nullptr & ->right !nullptr /two children ->element findmint->right )->elementremovet->elementt->right )else binarynode *oldnode tt ->left !nullptr ->left ->rightdelete oldnodefigure deletion routine for binary search trees