The constant time removal of last node in a SLL is the limitation of approach you have in mind. -- I read it in somewhere (may be Cracking Coding interview 4th edition) if we have access to head.. then.. its the trivial O(n) time.
On Monday, 9 July 2012 16:06:17 UTC-4, subharansu wrote: > > Is there any solution which will take care deleting a node Given only a > pointer to a node to be deleted in a singly linked list( > *How Do we consider deleting the last node*) * > * > > *Subhransu > * > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/a4A5kwf9X08J. 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.
