A BST such that:
- No node has two red links connected to it.
- Every path from root to null link has the same number of black links.
- Red links lean left.
%20(1).png)
%20(1).png)
{% hint style="success" %}
- Height of tree is ≤ 2 lg N in the worst case.
- Every path from root to null link has same number of black links.
- Never two red links in-a-row. {% endhint %}
%20(1).png)
%20(1).png)
%20(1).png)