Data tree structuring organising

[diellza.elshani.fl (DE FLI)]

Hello there,

can someone help me with structuring these data tree.

I need to have two lists out of this data tree,

One of them will contain the elements that have { x ; 0 } elements,
and the other the {x, 1} elements ,

if there is something in the list, I need to get the value 1 (or the length of the list) , if there is nothing on the list I need to get 0

thanks in advance,
DdataTree_Structure.gh (13.7 KB)

[Adam_M (Adam Mounsey)]

You can use List Length with Split Tree

[Joseph_Oster]

Yet another duplicate thread alert:

List length of data tree list

is there any way to sum the number of elements in a data tree, I have a data tree with three lists, where many rows are empty but some of them contain points, and I need to know how many elements in total has each row… each index correspondingly. …Regardless in which list it belongs too, I need to know the number in total, So as a result I need a list with the summed up list length of three lists. The length of the output should be the same, and I need to have numbers only…( 0 - if there is no…