Tree Comparisons

Hi all

i am trying to write a routine that will compare the data in two tree views
T1 and T2..where T1 is my ideal/benchmarking tree and T2 is the new tree.
right now i have a very dumb routine which recursively goes thru the tree and
compares node by node. basically it just compares the label strings.. but in
this case if a node is mssing in T2 it thowrs everything off and all the
remaining nodes are marked as different has anyone written a more intelligent
routine than this..i.e.

1. which will account for missing nodes.
2. which will find if the missing node is present at some other location

thanks in advance

rohan