code-tutorial.com

The best resources for developers

When pointer to a previous node is not available, deleting a middle node from a single linked list.

tempList = B->next;
*B = *tempList;
free(tempList);
struct List { struct List *next; MyData *data; };
struct HeavyList { struct HeavyList *next; char data[8192]; };

Tags: c linked-list data-structures

Source: By Nitin as answer to the question

This code snippet was collected from stackoverflow, and is licensed under CC BY-SA 2.5


Related code-snippets: