Data tree structuring organising

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)

You can use List Length with Split Tree

Yet another duplicate thread alert: :man_facepalming: