@Gene : http://groups.google.com/group/algogeeks/browse_thread/thread/9bbdd33a6b1e1c5f/fab5d6ad3840b74d?hl=en.&lnk=gst&q=+Find+the+path+in+two+nodes+of+a+binary+search+tree#fab5d6ad3840b74d
i guess this problem is similar to the given link solution by lucifier in the provided link would solve this problem. On Thu, Jan 19, 2012 at 7:13 PM, Gene <gene.ress...@gmail.com> wrote: > 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 algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
