Question: $12$

I need step by step answer for my better understanding

What is the maximum number of nodes in a binary tree of height h$?$

A$.2^$h

B$.2^$h $-1$

C$.2^($h$+1)-1$

D$.2^($h$-1)-1$

If You Write AI Answer $-$ I will give $15$ Dislikes For Sure.