I am struggling with a question that asks the number of trees that exist with x nodes and max level z. During my research I found that the number of binary trees with x nodes can be obtained by Catalan numbers. However, there is this element of max levels z. I don't know how that affects the problem. Can anyone provide me any guidance as to how to solve this problem? I obviously do not want a solution. I am trying to understand what is being asked so that I can solve it.
Number of Trees with n Nodes
1
$\begingroup$
trees
-
0Since you mention levels, these must be rooted trees. Are they binary trees, as suggested by your comment, or rooted trees in general? – 2012-07-10
-
0I believe it is referring to binary tree's. – 2012-07-10
-
0You should probably try to count the number of trees with at least $z+1$ levels and $x$ nodes. – 2012-07-10