Suppose I have two data trees. The first is the lower left (A), and the second is the lower right (B). I have to find the data path in the second data tree, which contains a certain value. In this case, the value is shown in the above panel.
So it should give me the output {0,2} in this case. After finding this data path, I need to rearrange the second data tree such that {0,2} will become the {0,0} and previous {0,0} & {0,1} should be added in the last to the same data tree.
Say the second data tree (B) has 7 branches. Now the new branch arrangement should be {0,2},{0,3},{0,4},{0,5},{0,6},{0,0},{0,1}
After this, I need to rearrange the data in an alternate pattern, such that the first data tree’s data should be in an odd place and the second data tree’s data should be in an even place.
Say the first data tree (A) also has 7 branches. Then, the final data should be like
A{0,0}
B{0,2}
A{0,1}
B{0,3}
A{0,2}
B{0,4}
A{0,3}
B{0,5}
A{0,4}
B{0,6}
A{0,5}
B{0,0}
A{0,6}
B{0,1}

