Hot answers tagged


This will depend on the nature of your tree. For a re-combining binomial tree, the number of nodes, including the initial one, will be \begin{align*} \sum_{i=1}^n i = \frac{n(n+1)}{2}. \end{align*} For the paths, as at each time $j$, there are two possibilities from each node, the total path number is $2^n$.

Only top voted, non community-wiki answers of a minimum length are eligible