Way to implement of deletion from a binary tree

Question

What is the way to implement of deletion from a binary tree?

Answer 1

To implement the deletion from a binary tree, here is a requirement to seem the possibilities of deleting the nodes.

Those are as given below:

• Node is a terminal node: If the node is the left child node of its parent, in that case the left pointer of its parent is set to NULL. But, if the node is right child node of its parent, in that case the right pointer of its parent is set to NULL.

• Node has merely one child: In such scenario, the suitable pointer of its parent is set to child node.

• Node has 2 children as: The predecessor is replaced through the node value, and after that the predecessor of the node is deleted.