linked list operations

delete_node.c

void delete_node ( struct node** head, elem_type x )
{
    for ( struct node** curr = head; *curr; )
    {
        struct node* entry = *curr;
        if ( entry->elem == x ) {
            *curr = entry->next;
            free ( entry );
        } else {
            curr = &entry->next;
        }
    }
}

reverse_linked_list.c

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

struct node
{
    int val;
    struct node * next;
};

typedef struct node node;

void reverse_linked_list(node* head)
{
    node* curr = head->next;
    node* latter = curr->next;
    curr->next = NULL;
    
    for (; latter; )
    {
	node* entry = latter;
	latter = entry->next;

	entry->next = curr;
	curr = entry;
    }

    head->next = curr;
}

void traverse_linked_list(node* head)
{
    for (node* h = head; h->next != NULL;)
    {
	h = h->next;
	printf("%d ", h->val);
    }
}

int main(void)
{
    node *head;
    node *prev = head;
    for (int i = 0; i < 10; i++)
    {

	node *n = (node*)malloc(sizeof(node));
	n->val = i;
	n->next = NULL;
      
	prev->next = n;
	prev = prev->next;
    }

//    traverse_linked_list(head);
    reverse_linked_list(head);
    traverse_linked_list(head);

    return 0;
}