Show that a red-black tree with black height bh has at least 2^bh –1 nodes. Look at the root. A black child has black height bh – 1. A red child must have two black children of black height bh – 1.