1. DeletionDelete a node x as in ordinary binary search tree.Note that the last node deleted is a leaf. Then trace the path fromthe new leaf towards the root . For each node…
