javascript - Why Right Then Left for Delete at Binary Search Tree?

Question

I now understood BST as good as deleting a node. But Now i have one simple question: When we have to delete a Node which has 2 Childs, why do we have to loop through the rightleft nodes? Is there a reason why we have to get exactly the most rightleft node? Thanks in advance!

question from:https://stackoverflow.com/questions/65847381/why-right-then-left-for-delete-at-binary-search-tree

Answer 1

Waitting for answers