le path from a node to any descendant leaf contains the same number of black nodes</p></li>
</ol>
</li>
<li><p>properties</p>
<ul>
<li><p>The height of the right and left subtree can differ by a factor of n</p></li>
<li><p>insert (Assume node is red and try to insert)</p>
<ol class="arabic simple">
<li><p>The new node is the root node</p></li>
<li><p>The new node‚Äôs parent is black</p></li>
<li><p>Both the parent and uncle (aunt?) are red</p></li>
<li><p>Parent is red, uncle is black, new node is the r