int numTrees(int n) {

```
int denominator = 1;
int numerator = 1;
int i;
for( i = 1; i <= n; i++)
{
denominator *= i;
}
i = n+2;
while(i <= 2*n)
{
numerator *= i;
i++;
}
return numerator / denominator;
}
```