@Ram and Nikhil What kind of traversal you will use to visit each node. How come you will get to know about teh number of nodes at each level that needs to be connected.
RK On Sun, Aug 1, 2010 at 2:56 AM, Nikhil Jindal <[email protected]>wrote: > @Ram Kumar: Yes. Simple and affective. > > Just at each node: > > node->left->side=node->right > node->right->side=node->side->left > > i.e at each node you are setting the side of each of your child. Go on and > just do it for all nodes. Done. > > On Sat, Jul 31, 2010 at 9:39 AM, Ram Kumar <[email protected]>wrote: > >> DONT DO A BFS!! NOT WORTH IT! CALL THE NEW POINTER AS 'SIDE' POINTER. >> >> for every root connect its left and right, for every root connect >> root->right and root->SIDE->left >> >> that ll do >> >> -- >> 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]<algogeeks%[email protected]> >> . >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > Please access the attached hyperlink for an important electronic > communications disclaimer: > http://dce.edu/web/Sections/Standalone/Email_Disclaimer.php > > > > -- > > 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] > <algogeeks%[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 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.
