Redarding remove method in bst

#1

what is the problem if we add node.left!=null and node.right!=null

#2

@Narasimha,
In this case we replace the value by max value from the left subtree. Then we go and remove that value from the left subtree. Then we give that a recursive call to remove it from the left child of the node we had to remove.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.