other solution might be to use doubly linked list, even if one pointer gets corrupt, there is other path to reach the destination.
On Wed, Jun 1, 2011 at 1:24 PM, Ashish Goel <[email protected]> wrote: > given a single linked list, there is a possibility of pointer corruption, > modify the data structure to ensure that the data is not lost. > > in my view a skip list is a good option, any other solutions? > > Best Regards > Ashish Goel > "Think positive and find fuel in failure" > +919985813081 > +919966006652 > > -- > 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. > -- Gaurav Aggarwal SCJP -- 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.
