Question: When deleting a node from a binary search tree that has two children, the reason we can replace its element with the greatest value in
When deleting a node from a binary search tree that has two children, the reason we can
replace its element with the greatest value in its left subtree is because
the value will be greater than everything on its left, and since it was in the left subtree, it will be less
than everything in the right subtree
the value will become greater or equal to the values of its children
Greatest value is the easiest to move
We don't replace nodes when removing from a BST
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
