maximum number of nodes (left side) with height(h)=2^(h)-1 = 63
Now the minimum number of nodes N(h)=N(h-1)+N(h-2)+1 , N(0)=1, N(1)=2
After solving the equation you will get N(6)=33 but we will see in only right most so
right side =33*1/3 = 1½ = 5
so total nodes= 63+5+1 =69