If you know circular list, what is avoiding you from maintaining a tail pointer. You just need to tweak insert and delete function a little bit for corner cases.
On Sat, Jul 23, 2011 at 12:50 AM, rShetty <[email protected]> wrote: > Algorithm Please ... Thank You > > On Jul 23, 12:17 am, vaibhav shukla <[email protected]> wrote: > > maintain just a tail pointer!!!! > > > > On Sat, Jul 23, 2011 at 12:45 AM, rShetty <[email protected]> wrote: > > > Come Up with an Algorithm to implement the insertion of a node in > > > circular linked list without actually traversing the list ? > > > > > -- > > > 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. > > > > -- > > best wishes!! > > Vaibhav > > MCA > > -- > 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 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.
