We want to 'destroy' a list, i.e. free() all the cells in it. we propose the following function : void destroyList(t_list *ptr_list)
{
t_cell *cur;
t_cell *prev;
while (ptr_list-head !=NULL)
{
cur = ptr_list-head;
prev = cur;
while (cur-next != NULL)
{
prev = cur;
cur = cur-next;
}
prev-next = NULL; free(cur);
} }

What can you say about this function? (several answers)

Question

We want to 'destroy' a list, i.e. free() all the cells in it.  we propose the following function : void destroyList(t_list *ptr_list) 
 { 
    t_cell *cur; 
    t_cell *prev; 
    while (ptr_list->head !=NULL) 
    { 
       cur = ptr_list->head; 
       prev = cur; 
       while (cur->next != NULL) 
       { 
            prev = cur; 
            cur = cur->next; 
       } 
       prev->next = NULL;       free(cur); 
     } } 
   
 What can you say about this function? (several answers)

Accepted Answer

This function does a lot of list browsing, so we can make it more efficient

Accepted Answer

this function is iterative

Accepted Answer

This function does not release the first cell - the program crashes!

Answer

Answer

This function effectively frees the list

Answer

This function is recursive

Crowdly

We want to 'destroy' a list, i.e. free() all the cells in it. we propose the fo...

Want instant access to all verified answers on moodle.myefrei.fr?