I have a tree that consists of branches. In the figure below for example, Branch {0} has 6 sub-branches (if we may call it like this): {0;0} … {0,5}. So whole tree has sub-branches and the branches don’t have the same number of sub-branches in real situation.
Is there a way I can know how many sub-branches each branch has? In other words, I need to extract the highest value of B in A in the path {A;B}. Thank you so much for your support…
what about something like this? The result gives you the number of the branch and the number of sub-branches included in it. I tested with other variations and it seems to work, but it may depend on your original tree structure.
and if data in the branch is “groupable”, you can shortcut the whole thing in 3 components (you can even just List Item instead of Group, just to keep the branch “alive”, because it’s not the number of items in a branch but just if the branch exists or not )