closed by
294 views
1 votes
1 votes
closed as a duplicate of: GATE CSE 2015 Set 2 | Question: 11
int fun(int n)

{

int x=1,k;

if(n==1) return x;

for(k=1;k<n;++k)

x=x+fun(k)*fun(n-k)

return x;

}

return value of fun(5)???   how to solve this using tree method approach???
closed by

Related questions

41 votes
41 votes
4 answers
1