Add a Tree to the left of the tree
Add two (same shape) trees together, each leaf node is added
Reduce the tree to a value, by recursively applying fold to the branches, combining the results using g and transforming the leaves using f
Get the contents of the leaf node element at position n from the left, indexed from 0
Get the contents of the leaf node element at position n from the left, indexed from 0
the node position from the left
Combine two trees which are the same shape using the function f
Add a Tree to the right of the tree
A binary tree implementation, to be used when combining models Hopefully this simplifies "zooming" into values and changing them