10
4 5
2 7 6 11
1 3 9 8 12 13 14 15
For this the cousins of 1 should be 9 8 12 13 14 15 .... how
then can it be a 2 pass algorithm... we should also consider great
grandparent as in this case ... Correct me if I m wrong!!
On Tuesday, 19 April 2011 05:33:26 UTC+5:30, ashgoel wrote:
>
> This essentially becomes a two pass algo
>
> first find the parent and grand parent and find children of all the
> siblings of the parent
>
>
> Best Regards
> Ashish Goel
> "Think positive and find fuel in failure"
> +919985813081
> +919966006652
>
>
> On Thu, Apr 14, 2011 at 9:53 AM, Dave <[email protected]> wrote:
>
>> @Priya: Assuming that "cousins" means "first cousins," then cousins
>> have a common grandparent but different parents. Other people on the
>> same level would not be first cousins.
>>
>> The algorithm is to go up two levels (to the grandparent) and descend
>> to the other child (to an aunt or uncle). The children of that node
>> are the cousins.
>>
>> Dave
>>
>> On Apr 13, 11:13 pm, priya mehta <[email protected]> wrote:
>> > i hope all the cousins means all the nodes on the same level, so it
>> should
>> > be done using level order traversal.
>> >
>> > On Thu, Apr 14, 2011 at 8:38 AM, sravanreddy001 <
>> [email protected]>wrote:
>> >
>> >
>> >
>> > > Yes, this is correct, and to move the data in the array, its simple,
>> just
>> > > do a traverse and populate the array..
>> >
>> > > another way is to put data into queue and putting only one level of
>> data at
>> > > a time, this reduces the space consumption but... only by half...
>> >
>> > > --
>> > > 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.- Hide quoted text -
>> >
>> > - Show quoted text -
>>
>> --
>> 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.
>>
>>
>
On Tuesday, 19 April 2011 05:33:26 UTC+5:30, ashgoel wrote:
>
> This essentially becomes a two pass algo
>
> first find the parent and grand parent and find children of all the
> siblings of the parent
>
>
> Best Regards
> Ashish Goel
> "Think positive and find fuel in failure"
> +919985813081
> +919966006652
>
>
> On Thu, Apr 14, 2011 at 9:53 AM, Dave <[email protected]> wrote:
>
>> @Priya: Assuming that "cousins" means "first cousins," then cousins
>> have a common grandparent but different parents. Other people on the
>> same level would not be first cousins.
>>
>> The algorithm is to go up two levels (to the grandparent) and descend
>> to the other child (to an aunt or uncle). The children of that node
>> are the cousins.
>>
>> Dave
>>
>> On Apr 13, 11:13 pm, priya mehta <[email protected]> wrote:
>> > i hope all the cousins means all the nodes on the same level, so it
>> should
>> > be done using level order traversal.
>> >
>> > On Thu, Apr 14, 2011 at 8:38 AM, sravanreddy001 <
>> [email protected]>wrote:
>> >
>> >
>> >
>> > > Yes, this is correct, and to move the data in the array, its simple,
>> just
>> > > do a traverse and populate the array..
>> >
>> > > another way is to put data into queue and putting only one level of
>> data at
>> > > a time, this reduces the space consumption but... only by half...
>> >
>> > > --
>> > > 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.- Hide quoted text -
>> >
>> > - Show quoted text -
>>
>> --
>> 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.
>>
>>
>
On Tuesday, 19 April 2011 05:33:26 UTC+5:30, ashgoel wrote:
>
> This essentially becomes a two pass algo
>
> first find the parent and grand parent and find children of all the
> siblings of the parent
>
>
> Best Regards
> Ashish Goel
> "Think positive and find fuel in failure"
> +919985813081
> +919966006652
>
>
> On Thu, Apr 14, 2011 at 9:53 AM, Dave <[email protected]> wrote:
>
>> @Priya: Assuming that "cousins" means "first cousins," then cousins
>> have a common grandparent but different parents. Other people on the
>> same level would not be first cousins.
>>
>> The algorithm is to go up two levels (to the grandparent) and descend
>> to the other child (to an aunt or uncle). The children of that node
>> are the cousins.
>>
>> Dave
>>
>> On Apr 13, 11:13 pm, priya mehta <[email protected]> wrote:
>> > i hope all the cousins means all the nodes on the same level, so it
>> should
>> > be done using level order traversal.
>> >
>> > On Thu, Apr 14, 2011 at 8:38 AM, sravanreddy001 <
>> [email protected]>wrote:
>> >
>> >
>> >
>> > > Yes, this is correct, and to move the data in the array, its simple,
>> just
>> > > do a traverse and populate the array..
>> >
>> > > another way is to put data into queue and putting only one level of
>> data at
>> > > a time, this reduces the space consumption but... only by half...
>> >
>> > > --
>> > > 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.- Hide quoted text -
>> >
>> > - Show quoted text -
>>
>> --
>> 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.
>>
>>
>
On Tuesday, 19 April 2011 05:33:26 UTC+5:30, ashgoel wrote:
>
> This essentially becomes a two pass algo
>
> first find the parent and grand parent and find children of all the
> siblings of the parent
>
>
> Best Regards
> Ashish Goel
> "Think positive and find fuel in failure"
> +919985813081
> +919966006652
>
>
> On Thu, Apr 14, 2011 at 9:53 AM, Dave <[email protected]> wrote:
>
>> @Priya: Assuming that "cousins" means "first cousins," then cousins
>> have a common grandparent but different parents. Other people on the
>> same level would not be first cousins.
>>
>> The algorithm is to go up two levels (to the grandparent) and descend
>> to the other child (to an aunt or uncle). The children of that node
>> are the cousins.
>>
>> Dave
>>
>> On Apr 13, 11:13 pm, priya mehta <[email protected]> wrote:
>> > i hope all the cousins means all the nodes on the same level, so it
>> should
>> > be done using level order traversal.
>> >
>> > On Thu, Apr 14, 2011 at 8:38 AM, sravanreddy001 <
>> [email protected]>wrote:
>> >
>> >
>> >
>> > > Yes, this is correct, and to move the data in the array, its simple,
>> just
>> > > do a traverse and populate the array..
>> >
>> > > another way is to put data into queue and putting only one level of
>> data at
>> > > a time, this reduces the space consumption but... only by half...
>> >
>> > > --
>> > > 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.- Hide quoted text -
>> >
>> > - Show quoted text -
>>
>> --
>> 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.
>>
>>
>
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/GOaC6sF-qlAJ.
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.
