it wont work.u can set a sentinel value for the last node and make it dummy.so every time u scan the list u need to compare
while(list != null and list->vlue != dummy) On Mon, Sep 5, 2011 at 6:34 PM, $hr! k@nth <[email protected]> wrote: > How this will work if the node to be deleted is the last node?? > > > On Mon, Sep 5, 2011 at 5:32 PM, kARTHIK R <[email protected]> wrote: > >> void delete(node *ptr) { >> >> node *newptr = ptr->next; >> ptr->val = newptr->val; >> ptr->next = newptr->next; >> delete newptr; >> >> } >> >> >> Karthik R, >> R&D Engineer, >> Tejas Networks. >> >> >> >> On Mon, Sep 5, 2011 at 5:29 PM, $hr! k@nth <[email protected]> wrote: >> >>> Hi guyz, >>> >>> *Given only a pointer to a node to be deleted in a singly linked list, >>> how do you delete it?* >>> >>> if that node is in between the list, we can copy the data from next node >>> into this node and we can delete the next node. >>> what if the node to be deleted is last node ?? >>> if the list is circular linked list, does it make any difference?? >>> >>> -- >>> Regards, >>> $hr!k@nth >>> >>> -- >>> 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. >> > > > > -- > Regards, > $hr!k@nth > > -- > 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.
