Q16

In this GATE ques- Part a) For Size balanced tree the recurrence (max height) is T(h)=T(h-1) +T(h-2) +1, solving which we get T(0)=1, T(1)=2,T(2)=1+2+1=4, T(3)=4+2+1=7 Here, T(0),T(1),T(2) are of the form 2h but T(3) is not equal to 23 then how can we claim that "size-balance binary tree of height 'h' contain at least 2h nodes." ?