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...

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.