Hi,
For example I have that tree with 7 branches, each branch has 1 item less as the previous one:
[0,1,2,3,4,5,6]
[0,1,2,3,4,5]
[0,1,2,3,4]
[0,1,2,3]
[0,1,2]
[0,1]
[0]
How can I sort the tree as follows:
[0,0,0,0,0,0,0]
[1,1,1,1,1,1]
[2,2,2,2,2]
[3,3,3,3]
[4,4,4]
[5,5]
[6]
So the first branch will have all the first items of input tree, the second branch - all the second items, the third - all the third items and so on
I would be grateful for any suggestions !
