markovTreePathCount

Compute the number of path at the Nth rank of a bivalent tree

This work has been done to study the behavior of a markov random walk in regard to its rank, and its connection to a normal distribution.
e.g. :
%% Tree calculus
N = 1000;
V = markovTreePathCount(N);
max_path = 2^N;
P = V / max_path
plot(P)