I have a list of all Brand Trees. 1 list of Brand Trees is not exhaustive. How to fill that list with empty Brand Trees in the missing positions. Thank you.
data tree.gh (8.3 KB)
I have a list of all Brand Trees. 1 list of Brand Trees is not exhaustive. How to fill that list with empty Brand Trees in the missing positions. Thank you.
Don’t have any ideas?
Brand trees?
Do you mean data tree branches?
correct, maybe I wrote it wrong
Do you have any ideas to help me?
I’m not sure if I understand your question yet.
Input branches 0;0 and 0;2 contain more than one item, the other two branches contain just one item.
Are you looking for a solution to add one empty branch if the length of the list is just one?
add_empty.gh (15.8 KB)
I’m sorry. simply opening the caplock
Ok, so the goal is to add a branch whenever a character is missing in the sequence from A to Z?
Where are B and D supposed to come from?
What’s defining the number of branches?
add_empty.gh (19.8 KB)