Find centralized, trusted content and collaborate around the technologies you use most.
Learn more about CollectivesStack Internal
Knowledge at work
Bring the best of human thought and AI automation together at your work.
Explore Stack Internalstruct node{ int position; char name[30]; struct node * next; }; void free_list(node * list){ node* next_node; printf("\n\n Freeing List: \n"); while(list != NULL) { next_node = list->next; printf("clear mem for: %s",list->name); free(list); list = next_node; printf("->"); } } struct node{ int position; char name[30]; struct node * next;}; void free_list(node * list){ node* next_node; printf("\n\n Freeing List: \n"); while(list != NULL) { next_node = list->next; printf("clear mem for: %s",list->name); free(list); list = next_node; printf("->"); }} struct node{ int position; char name[30]; struct node * next; }; void free_list(node * list){ node* next_node; printf("\n\n Freeing List: \n"); while(list != NULL) { next_node = list->next; printf("clear mem for: %s",list->name); free(list); list = next_node; printf("->"); } } 
struct node{ int position; char name[30]; struct node * next;}; void free_list(node * list){ node* next_node; printf("\n\n Freeing List: \n"); while(list != NULL) { next_node = list->next; printf("clear mem for: %s",list->name); free(list); list = next_node; printf("->"); }}