Recursion(power)

#1

can u provide me the stack working details of recursion(power) question

#2

recursion_pow
recursion_pow730×548 55 KB

This would be the stack if you use put the base case as :
if(n==1){
return x;
}

if you use the base case with n==0, the there will be one more level in the stack (at the bottom in the picture), which will return 1.