I would like to know if there is a reference/textbook/algorithm that explain
how to compare two _labelled_ tree.
Any comments is very valuable for me
thanks in advance
I would be glad to get some help in this problem:
The definition of the crossing problem is crossing n unsorted numbers to
two sub serials S1,S2 thus
for each y from S2 and x from S1
I should use a decision tree in order to prove that every comparisons based
algorithm that solve this problem
execute at least n+0.5lgn-O(1) comparisons.