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??? Phalkey asked Aug 18, 2018 closed Aug 18, 2018 by srestha Phalkey 296 views comment Share Follow See 1 comment See all 1 1 comment reply Rishav Kumar Singh commented Aug 18, 2018 reply Follow Share Phalkey i tried solving it with tree method but its very tedious, why don't you follow this approach, its best approach for questions like this https://gateoverflow.in/8060/gate2015-2-11 1 votes 1 votes Please log in or register to add a comment.