yup atul algo is correct
(cur_data - node->right) * ( cur_data- node->left) < -1 for ancestors
On Thu, Apr 8, 2010 at 10:19 AM, atul verma <atul.ii...@gmail.com> wrote:
> Its very simple to solve this.
>
> Start from root.
>
> Compare the value of current node data value to both nodes.
>
> 1. if both are greater than current node then traverse node->right
> 2. if both are lesser than current node then traverse node->left
> 3. else return current node pointer.
>
> Any comments,
>
> Atul
>
>
> On Thu, Apr 8, 2010 at 10:15 AM, Pramod Negi <negi.1...@gmail.com> wrote:
>
>> could you please elucidate more??
>>
>>
>> On Wed, Apr 7, 2010 at 10:34 PM, Himanshu Aggarwal <
>> lkml.himan...@gmail.com> wrote:
>>
>>> For a given binary tree, given the root and two node pointers, how can we
>>> find their youngest common ancestor.
>>>
>>> Say the node is like:
>>>
>>> struct node{
>>> int data;
>>> struct node*left, *right;
>>> };
>>>
>>> i.e the father field is not there.
>>>
>>> Please note that it is not a binary search tree, but just a binary tree.
>>>
>>> Thanks,
>>> Himanshu
>>>
>>> --
>>> You received this message because you are subscribed to the Google Groups
>>> "Algorithm Geeks" group.
>>> To post to this group, send email to algoge...@googlegroups.com.
>>> To unsubscribe from this group, send email to
>>> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@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 algoge...@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@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 algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com>
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
How soon 'not now' becomes 'never'...
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@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.
