Actually, The number of operations required to call what(n-1) like pushing the activation records onto the stack etc overshadow the time taken for B(n) when we are talking in asymptotic world. So, the recurrence relation will be
T(n) = T(n-1) + O(1), solving this, we get
T(n) = O(n).