資料結構與演算法(A)

(5 points) Consider a red-black tree with $n$ internal nodes, where $n$ is even. At most how many of them can be a black node with one red child?