void printList (nodePT L) { nodePT curr = } malloc(sizeof(struct node)); curr = L; while (curr...

   

Transcribed Image Text:

void printList (nodePT L) { nodePT curr = } malloc(sizeof(struct node)); curr = L; while (curr != NULL) { 11 printf("%d, } nodePT prev = curr; I curr->data); malloc(sizeof(struct node)); prev curr = curr->next; // line 1 // line 2 // line 3 // line 4 // line 5 // line 6 // line 7 O The call works without any problem. It is correct code that prints the data from each node of the given linked list, L. There will be no memory leaks or any bad memory access. O The call will cause 2 memory leaks. O The call will cause 5 memory leaks. O The call will cause 6 memory leaks. void printList (nodePT L) { nodePT curr = } malloc(sizeof(struct node)); curr = L; while (curr != NULL) { 11 printf("%d, } nodePT prev = curr; I curr->data); malloc(sizeof(struct node)); prev curr = curr->next; // line 1 // line 2 // line 3 // line 4 // line 5 // line 6 // line 7 O The call works without any problem. It is correct code that prints the data from each node of the given linked list, L. There will be no memory leaks or any bad memory access. O The call will cause 2 memory leaks. O The call will cause 5 memory leaks. O The call will cause 6 memory leaks.

Answer rating: 100% (QA)

The code snippet provided in the image is intended to print the data from each node in a linked list ... View the full answer