Draw an example of a red-black tree that is not an AVL tree. 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...

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 zero children, the removed node was a red leaf.