In this paper, we are interested in the number of red nodes in red-black trees. We first present an time dynamic programming solution for computing , the largest number of red internal nodes in a red-black tree on n keys. Then the algorithm is improved to some time recursive and nonrecursive algorithms. Based on these improved algorithms we finally find a closed-form solution of .