//Precondition: A valid linked-list that may possibly be empty //and an integer value //Postcondition: A new node with provided value is added to the //the end of the list. The head and tail pointers are appropriately //updated void addIntToEndOfList (LinkedList *list, int value) { assert (list! = NULL);//if list is NULL, we can do nothing. Node *p;//temporary pointer //TODO: //(1) Allocate a new node. p will point to it. p = NULL;//THIS IS PLACE-HOLDER LINE OF CODE. DELETE IT AND REPLACE IT. //(2) Set p's data field to the value passed in //(3) Set p's next field to NULL if (list head == NULL) { //(4) Make both head and tail of this list point to p } else { //Add p at the end of the list. //(5) The current node at the tail? Make it point to p instead of NULL //(6) Make the tail of the list be p now. } } //Precondition: A valid linked-list that may possibly be empty //and an integer value //Postcondition: A new node with provided value is added to the //the end of the list. The head and tail pointers are appropriately //updated void addIntToEndOfList (LinkedList *list, int value) { assert (list! = NULL);//if list is NULL, we can do nothing. Node *p;//temporary pointer //TODO: //(1) Allocate a new node. p will point to it. p = NULL;//THIS IS PLACE-HOLDER LINE OF CODE. DELETE IT AND REPLACE IT. //(2) Set p's data field to the value passed in //(3) Set p's next field to NULL if (list head == NULL) { //(4) Make both head and tail of this list point to p } else { //Add p at the end of the list. //(5) The current node at the tail? Make it point to p instead of NULL //(6) Make the tail of the list be p now. } }