I found a recursive tree for T(n)=T(n/2)+T(n/3)+n but still am confused about how the recursive tree is with a cost of 1 at each level.
what is its height?
How