How do you you delete a node in singly linked list only pointer to that node is given in C?

Answer 1

Firstly, thanks for trying solve this algorithm.

I will rewrite the wrong way and debug it in the next line, and the causes in th last line , O right?


wrong:void delete(int n).
debug:void delete_node(node* list, int n).
causes:
-You have to include the name of the list from which you want to delete a node. -you used delete as a name of the function, and that is impossible because delete is a predefined function, use delete_node for example.




wrong:you didn't affect the address of the list to the temporary pointer named here P.
debug:p=list.
causes:
-one of the disadvantages of the chained list -unlike contiguous list-is: to arrive to the the required node, we have to traverse all previous nodes to get the required one, therefor we use that temporary pointer, and this latter mast have to start from the first node names here list.


the rest is right, try this code, I think it works::


void delete_node(node *list, int n)
{
node *p;
p=list;
int i=1;
while(i
{
p=p->next;
++i;
}
node *q;
q=p->next;
p->next=q->next;
free(q);
}



Best regards of InfoMan.

Answer 2

Ya We can Do that actually.

1. Copy the content of the next node in to the node that has to be deleted.

2. Assign the next pointer of the newly copied node of to the next pointer of the node from the content has been copied.

3. Delete the node from the data has copied.

Another way of above problem is do a memcpy on current node from next node. and delete the next node would be more faster and optimized.

Answer 3

Let's assume you're using a custom LinkedList (as the one build into Java has this implemented for you).

class LinkedList {

LinkedListNode root;

// Remove the nodes which contain data equal to obj

void deleteNode(Object obj) {

// special case for root

if( root.data.equals(obj) ) {

root = root.next;

}

LinkedListNode current = root;

// iterate through list looking for obj

while( current.next != null ) {

// match found

if( current.next.data.equals(obj) ) {

// cut out the node

current.next = current.next.next;

}

current = current.next;

}

}

private class LinkedListNode {

Object data;

LinkedListNode next;

}

}