Question

() Given the following structure definition and typedef for a linked list of strings:

typedef struct node st node;

struct node st

{

char *word; /* a valid string pointer or NULL */

node *next; /* next node in the list or NULL */

};

Write a C function, free list(), that takes as an argument one of these lists, possibly NULL, and frees all the strings as well as the list itself.

Write robust code. void free list(node *list){

Answer 1

void free_list(node *list) {
    if (list != NULL) {
        node *temp;
        while (list != NULL) {
            temp = list->next;
            free(list);
            list = temp;
        }
    }
}