<Ul> <Li> Deleting a node with no children: simply remove the node from the tree . </Li> <Li> Deleting a node with one child: remove the node and replace it with its child . </Li> <Li> Deleting a node with two children: call the node to be deleted D. Do not delete D. Instead, choose either its in - order predecessor node or its in - order successor node as replacement node E (s . figure). Copy the user values of E to D. If E does not have a child simply remove E from its previous parent G. If E has a child, say F, it is a right child . Replace E with F at E's parent . </Li> </Ul> <Li> Deleting a node with no children: simply remove the node from the tree . </Li> <Li> Deleting a node with one child: remove the node and replace it with its child . </Li> <Li> Deleting a node with two children: call the node to be deleted D. Do not delete D. Instead, choose either its in - order predecessor node or its in - order successor node as replacement node E (s . figure). Copy the user values of E to D. If E does not have a child simply remove E from its previous parent G. If E has a child, say F, it is a right child . Replace E with F at E's parent . </Li>

Describe the techniques of binary tree with example in hindi