Now, if we search the branches of new combined tree in parallel, it's obvious that we can always find the target node at lowest possible level.
we can generate shortest length description using our algorithm.