CODEIT01 - TREE SHAPES
Given n, the number of nodes, find the number of different possible binary trees that can be constructed. A tree differs from another tree if it’s shape looks different.
The first line is an integer t, denoting the number of test cases. Then each test case consists of one integer n, the number of nodes.
For each test case print the number of possible trees that can be constructed using n nodes in a separate line.
Print the answer mod 10^9+7.
4 1 2 3 4
1 2 5 14