Consider a red-black tree with nnn internal nodes, where nnn is even.
At most how many of them can be a black node with one red child?