Thursday, December 27, 2007
Given only a pointer to a node to be deleted in a singly linked list, how do you delete it?
Posted by Admin at 12:35 PM
Labels: Linked Lists
Subscribe to:
Post Comments (Atom)
skip to main |
skip to sidebar
More content will be added soon , if you have any different or better solution then please post in the comment section of the respective question.
Labels
- Adhoc Programs (20)
- Arrays (5)
- C (120)
- C++ (1)
- Free ebooks (1)
- Graph (1)
- Hash (1)
- Heap (1)
- Linked Lists (22)
- Object Oriented Design (1)
- Online video Lectures (17)
- Puzzles (2)
- Queue (1)
- Stack (1)
- Strings (20)
- Trees (26)
1 comments:
copy the data from the next node to the current node and delete next node.
but fails if the current node itself is the last node ofthe list.
if(node->next)
{
//copy the data
node->value=node->next->value;
// delete the node.
temp=node->next;
node->next=temp->next;
free(temp);
}
else
{
printf("cant delete already at the last node");
}
Post a Comment