@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 <priya.mehta...@gmail.com> 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 > <sravanreddy...@gmail.com>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 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.- 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 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.
