Re: [algogeeks] Re: Query on a tree again!

Hi Shashank, It could be. But if the tree has only 2 branches, and A, B lie as two leaf nodes on each branch, there won't be any more leaf position for C. Thus, C has to lie on the path between A and B. Could you give me some hint to find C in O(lgN) though? On Mon, Mar 4, 2013 at 3:19 PM, BackBen

[algogeeks] Re: Query on a tree again!

Hi Danh , shouldn't be C will farthest leaf node from given A and B ? Thanks Shashank On Sunday, January 13, 2013 7:43:23 AM UTC+5:30, Danh Nguyen wrote: > > Hi everyone, > > I'm trying to solve this problem, but I have no idea to > begin