Linked List Code Snippets

#include <stdio.h>
#include <stdlib.h>
Copy

C - Creating a node or linked list using struct

C - Print each value of a linked list

C - Reverse a linked list

C - Add an item to the BEGINNING of the linked list

C - Add an item to the END of linked list

C - Iteratively add nodes of a NEW linked list

C - Iteratively add nodes to the end of an EXISTING linked list

C - Removes FIRST node and remembers what the value of it

C - Removes LAST node and remembers what the value of it

C - Remove node by INDEX of linked list and remembers what the value of it

C - Removes node by VALUE and also remembers what the value of it

ITS IMPORTANT TO FREE ALL NODES!
Don't simply do this free(linked_list_name). That will only free one block of memory!!

Do this instead:

while (linked_list_name != NULL)
    {
        node *tmp = linked_list_name->next;
        free(linked_list_name);
        linked_list_name = tmp;
    }
Copy