I believe you can use the Common Anchester algorithm, then your job is very easy, just find the lengths of the nodes from common achester node. As a binary tree any two nodes can be connected in only one path.
-Abhi --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
