Gate Exam Programming

There is a full binary tree with 200 leaf nodes then find the number of such nodes who has exactly 2 child nodes.

Read Solution (Total 1)

Gate Other Question
int get(int n)
{
if n<1 get(n-1);
get(n-3);
return (0);
}

If get(6) is called through main then how many times get() function is called? Find the value of lim(x tends to infinite) a^b

where a= 1+x^2
b= e^(-x)