The maximum number of nodes in a binary tree of height $h$ is:

a$.2^{h+1}-1$

b$.$ None

C$.2^{h+1}$

d$.2^h-1$