Help on tree comparison

Help on tree comparison

Post by Glenn T Jayapute » Wed, 28 Aug 1991 22:31:23



HELP.............................

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

Glenn Jayaputera

 
 
 

1. Using decision trees to find lower bound of comparisons

Hi !

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
exist x<y.

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.

Thanks

      Ohad.

2. FS: Indigo2 R10000 195Mhz Solid IMPACT $9850

3. Looking for trees comparison algorithms

4. Real greenhorn asks "connection teaming"

5. HELP HELP HELP HELP HELP HELP HELP HELP HELP HELP HELP HELP etc...

6. PDP-8 System wanted

7. references for S-trees and S+-trees

8. Importing MS Access Forms in FP98

9. In order tree walk for patricia tree?

10. Partitioning a Weighted Tree into Evenly Weighted Sub-Trees

11. AVL trees vs Threaded AVL trees.

12. algorithm to convert general tree to binary tree ?