l do follow you well. but for the leafs when l add 100 leafs (level 2), how
can you capture what are the leafs of a given children.
let's dive in more details :
level 1 child 1 child 2 ..... child 10
level 2 leaf 1 leaf 2 ....... leaf 10
for example : can we retrieve who are the leafs of a given child k :
l want something like that child k such that k [1..10] has leaf m leaf
m+2 leaf m+ 59
for instance child 6 has leaf 67 leaf 3 leaf 45 leaf 2
child 1 has leaf 5 leaf 7 leaf 56
.
.
.
child 10
the total number of leafs is 100 in level 2. the childs dont't have the
same number of leafs :
for examples child 1 has 3 leafs
child 2 has 6 leafs
the sum of leafs = 100
the number of leafs for each child is done randomly.
Hope you get the point
thanks a lot for your helps Andre
On Fri, Jul 1, 2016 at 12:41 PM, Andre Bieler <[email protected]>
wrote:
> Well the child can also have children, just like in your graph you
> attached. This is then one level down in your graph.
>
> Note that the root is of the same type as the children. (MyNode can be
> parent, child, grandchild etc.) The children are just put inside the root.
> Then you can continue and put children into these children. This is how you
> get the tree structure.
>
> I hope this is somehow clear.
>
> Best,
> Andre
