It is helpful to know the parent nodes for each tree node. This function creates a matrix with that information.
make.leaf.paths(up.to = 2047)
Number of rows for which to compute leaf.paths.
The ith row of the resulting matrix lists all the leaves, including i, that would be traversed from the root to leaf i. Unneeded columns have zeros.
Numeric matrix with "up.to" rows. If 2^j <= up.to < 2^(j+1), j columns.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.