Assume that a circular doubly linked list has heen created, as in Figure 3.31. A

Question

Assume that a circular doubly linked list has heen created, as in Figure 3.31. After each of the following assignments, indicate changes made in the list by showing which links have been modified. Process these assignments in sequence that is the second assignment should make changes in the list modified by the first assignment and so on. list.next.next.next = list.prev; list.prev.prev.prev = list.next.next.next.prev; list.next.next.next.prev = list.prev.prev.prev; list.next.prev.nex = list.next.next.next; second assignment should make changes in the list modified by the first assignment and so on. List.next.next.next = list.prev; list.prev.prev.prev = list.next.next.next.prev; list.next.next.next.prev = list.prev.prev.prev; list.next = list.next.next; list.next.prev.next = list.next.next.next; A circular doubly linked list.

Explanation / Answer

static void linked_list_add (linked_list_t * list, void * data) { link_t * link; /* calloc sets the "next" field to zero. */ link = calloc (1, sizeof (link_t)); if (! link) { fprintf (stderr, "calloc failed. "); exit (EXIT_FAILURE); } link->data = data; if (list->last) { /* Join the two final links together. */ list->last->next = link; link->prev = list->last; list->last = link; } else { list->first = link; list->last = link; } }

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.