Problem
1. Insert the keys c, o, r, n, f, l, a, k, e, s into an initially empty red-black tree.
2. Insert the keys a, b, c, d, e, f, g, h, i, j, k into an initially empty red-black tree.
3. Find a binary search tree whose nodes cannot be colored so as to make it a red-black tree.