(I was not really sure in which "stackexchange" I should put this question. I hope CS is ok.)
Now I want to pick out a part of the graph A. The information of the subtree is given by a node ID in the original tree A.
You might have noticed that the new tree have the same structure than the old tree. The unique ID of each node in the new tree, will also be counted up in breadth-first order. In the brackets, you can see the link to the original node tree A.
The reason, why I need this node link is the fact that I need to copy some node properties from the original tree node to the new tree node.
What is the mathematical relation between the unique node IDs of the new tree and the node IDs of the original tree? I want to compute the ID's of the old tree, based on the ID's of the new tree.
Thanks for any help.