Intermediate C Programming, 2nd Edition

Chapter 20Programming Problems Using Linked List

DOI: 10.1201/9781003257981-20

20.1 Queues

The function List_insert in Section 19.3 always inserts the new value at the beginning of the list. If we always delete nodes from the front of the list, then the linked list is a stack. In this problem, we change the insert function so that (1) the first inserted value is at the beginning of the list and (2) the value inserted most recently is at the end of the list. If we still remove elements from the beginning of the list we have created a queue, like a line at a store waiting for service.

1    // CH20:insertqueue.c2    Node * List_insert(Node * head, int val)3    {4      if (head == NULL)5        { return Node_construct(val); }6      Node * p ...