Question: Let T be a red-black tree and let p be the position of the parent of the original node that is deleted by the standard
Let T be a red-black tree and let p be the position of the parent of the original node that is deleted by the standard search tree deletion algorithm. Prove that if p has one child, the deletion has caused a black deficit at p, except for the case when the one remaining child is a red leaf.
Step by Step Solution
3.40 Rating (172 Votes )
There are 3 Steps involved in it
If p has one child after the deletion then it must have ... View full answer
Get step-by-step solutions from verified subject matter experts
