As stated above , answer is false.

the explanation is as follows.

the no of leaf nodes in a binary tree - max

=2^(height+1) -1

=(2^(3+1))-1 = 16-1=15

so tha maximum number of nodes in a binary tree of height 3 is 15.