ight child of parent</p></li>
<li><p>Parent is red, uncle is black, new node is the left child of parent</p></li>
</ol>
</li>
<li><p>Removal</p>
<ul>
<li><p>Do a normal BST remove</p>
<ul>
<li><p>Find next highest/lowest value, put it‚Äôs value in the node to be deleted, remove that highest/lowest node</p>
<ul>
<li><p>Note that that node won‚Äôt have 2 children!</p></li>
</ul>
</li>
<li><p>We replace the node to be deleted with it‚Äôs left child</p>
<ul>
<li><p>This child is N, it‚Äôs siblin