There are 2 Trees;
contains a branch structure with ‘4 branch depth’, all containing 1 value
contains ‘1 branch depth’ and contains, all containing 1 value.
I would like to add the values of Tree A + Tree B, whereby;
The tree branch of list B has so correspond to the 3rd ‘branch’ of list A.
Whereby the resulting tree has the same datastructure as tree A