Binary Search Tree: Deletion Overview

You are wrong on the third case: replacing the node value to be deleted with the smallest node on the right tree not necessarily be the leaf node always. It could be a node with one child that is a right child.

beautiful

Thanks!

It doesn't get any clearer or more concise , thanks for this.

What if you were deleting 100 from the BST, but neither the key 95, nor the key 110 were in the tree, your successor is 115 (which now has a left-child node of 120) and you predecessor is now 85 (but it has a left-child node of 80). What happens to these child nodes when you replace 100 with either 115 or 85? I imagine you have to move their pointers?

Straight to the point, simple, and clear. Thank you!

For clearity, in the case of deleting with 2 children. In the first way we find "inorder successor", and in the second way we find "inorder predecessor"

thank you a lot for your understandable explaination

Thank you

Best explanation Thanks Bro

Really great video

Clear and concise , just what is needed! Thanks a lot.

your intro and your voice is like shit

can you delete 125

good stuff

Thanks for the clear and quick explanation! I was struggling to figure out how to do it deleting the root node and this was the one video simple enough that I could understand

Short but helpful video. Thank you very much.

Thanks for the knowledge shared.Bless you

Thanks for the clear explanation.