Hi Anand, your dedicated and neatly formated reply is much appreciated! :)
On 16 June 2010 23:59, divya jain <sweetdivya....@gmail.com> wrote: > yes u need to start frm beg.. > > > > On 16 June 2010 17:15, Vivek Sundararajan <s.vivek.ra...@gmail.com> wrote: > >> so, this means that i can traverse the list only from the beginning of the >> link list right? >> >> what if im given a pointer pointing to some node other than the head of >> the doubly linked list? will i be able to traverse in any direction now? >> >> please let me know if im missing something :) >> >> Thank you, >> Vivek >> >> >> On 16 June 2010 15:37, divya jain <sweetdivya....@gmail.com> wrote: >> >>> u can xor linked list. such that every node link contains the xor of its >>> prev nd next node address.. since for 1st node prev is null ( 0) so its link >>> contains only next. now to calculate next of 2nd node xor its link with 1st >>> node's link nd u ll get 3 rd node.s adddress nd so on.. >>> >>> u can also use sum. store in link the sum of prev node n next node >>> address.. bt this cn result in overflow. so xor method is better >>> >>> >>> On 16 June 2010 09:14, sharad kumar <sharad20073...@gmail.com> wrote: >>> >>>> u have to use XOR linked list >>>> >>>> -- >>>> 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. >> > > -- > 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. > -- "Reduce, Reuse and Recycle" Regards, Vivek.S -- 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.
