Re: [algogeeks] Linkedlist problem

2011-09-06 Thread Arun prasath
if(nodeptr) { } On Mon, Sep 5, 2011 at 5:29 PM, $hr! k@nth srithb...@gmail.com 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

[algogeeks] Linkedlist problem

2011-09-05 Thread $hr! k@nth
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

Re: [algogeeks] Linkedlist problem

2011-09-05 Thread kARTHIK R
void delete(node *ptr) { node *newptr = ptr-next; ptr-val = newptr-val; ptr-next = newptr-next; delete newptr; } Karthik R, RD Engineer, Tejas Networks. On Mon, Sep 5, 2011 at 5:29 PM, $hr! k@nth srithb...@gmail.com wrote: Hi guyz, *Given only a

Re: [algogeeks] Linkedlist problem

2011-09-05 Thread $hr! k@nth
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 k4rth...@gmail.com wrote: void delete(node *ptr) { node *newptr = ptr-next; ptr-val = newptr-val; ptr-next = newptr-next; delete newptr; }

Re: [algogeeks] Linkedlist problem

2011-09-05 Thread sukran dhawan
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 srithb...@gmail.com wrote: How this will work if the node to be deleted is the last

Re: [algogeeks] Linkedlist problem

2011-09-05 Thread $hr! k@nth
@sukran: So can't I delete the last node, if pointer to that node is given? Can you please elaborate it.. On Mon, Sep 5, 2011 at 6:47 PM, sukran dhawan sukrandha...@gmail.comwrote: 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

Re: [algogeeks] Linkedlist problem

2011-09-05 Thread teja bala
@karthik here u'r just making the pointer null that means pointer reference gets lost but ? 1-23 here ? means pointer that gets lost if u make it null but the 2 node is still pointing to 3 , how would u solve dis one. On Mon, Sep 5, 2011 at 7:13 PM, kARTHIK R k4rth...@gmail.com wrote:

Re: [algogeeks] Linkedlist problem

2011-09-05 Thread sukran dhawan
ya no point in doingtat On Mon, Sep 5, 2011 at 7:51 PM, teja bala pawanjalsa.t...@gmail.com wrote: @karthik here u'r just making the pointer null that means pointer reference gets lost but ? 1-23 here ? means pointer that gets lost if u make it null but the 2 node is still