Here is a problem that arises in real security algorithms: Given a complete binary tree with N leaves (you can assume it's perfect as a simplification) and a particular leaf v, consider the path P from v to the root.
Then for the set of all other paths P' from other leaves v' /= v to the root, what is the average number of nodes shared between P and P'? -- 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?hl=en.
