Using the definition of a leaf as being an internal node with no children (both children are external nodes), how can I find the total number of leaves for all binary trees with n internal nodes, for any n.
I know the number of binary trees with n internal nodes is given by Catalan numbers however I can't work out how to enumerate all $C_n$ trees for each n to find number of leaves (as defined above).
Thanks for any help!