Question

/* list.c / struct list { struct list next; unsigned long val; }; struct list reverse(struct list head) { if (head == NULL) return head; struct list curr, prev; curr = head; prev = NULL; while (head->next != NULL) { head = head->next; curr->next = prev; prev = curr; curr = head; } curr->next = prev; return curr; }

          /* list.c */
struct list {
    struct list *next;
    unsigned long val;
};

struct list *reverse(struct list *head) {
    if (head == NULL) return head;

    struct list *curr, *prev;
    curr = head;
    prev = NULL;
    while (head->next != NULL) {
        head = head->next;
        curr->next = prev;
        prev = curr;
        curr = head;
    }
    curr->next = prev;
    return curr;
}

/* list.c */
struct list
struct list *next;
unsigned long val;
;

struct list *reverse(struct list *head)
if (head == NULL) return head;

struct list *curr, *prev;
curr = head;
prev = NULL;
while (head->next != NULL)
head = head->next;
curr->next = prev;
prev = curr;
curr = head;

curr->next = prev;
return curr;

Added by Madison K.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Shreya Jain

Step 1

The code defines a struct called "list" which has two members: a pointer to the next node in the list and an unsigned long integer value. Show more…

Show all steps

Thanks for your feedback!

/*list.c*/ struct list { struct list *next; unsigned long val; }; struct list *reverse(struct list *head) { if (head == NULL) return head; struct list *curr, *prev; curr = head; prev = NULL; while (head->next != NULL) { curr = head->next; curr->next = prev; prev = curr; head = head->next; } curr->next = prev; return curr; }