[LOGIC] - BST REMOVE NODE about data-structures-and-algorithms HOT 1 CLOSED

@vikkastiwari I hope my explanation reaches your expectation
So, According to your question we have to delete the node marked as Child1.

So after iterating we find that temp pointer is pointing to the child1 and the parent pointer is pointing to the root node. hope you understand how...

Now, according to your tree structure, temp->left is null so this means left side of child1 is null or empty so if I could make the parent node point to the left side of child1 then we can bypass the child1 hence removing it from the tree

hence we have parent->left = temp->left saying that parent left side will be now null and hence making child1 unreachable.

and to free the memory we use free(temp);

Hope, this helps

from data-structures-and-algorithms.