A simple upper bound on the redundancy of Huffman codes

Upper bounds on the redundancy of Huffman codes have been extensively studied in the literature. Almost all of these bounds are in terms of the probability of either the most likely or the least likely source symbol. We prove a simple upper bound in terms of the probability of any source symbol.