Question

14.   p contains the elements 66, 9, 14, 52, 87, 14 and 17, in that order. Consider running the following line of code:

p = question4(p);

where question4 is the function defined below. Show the contents of p after the function call.

struct node* question4(struct node *list) {
struct node* a = list; struct node* b = list; struct node* c; if (a == NULL) return NULL; while ( a->next != NULL)
a = a ->next;
a->next = b; c = b->next; b->next = NULL;
return c;
}

Answer:

15.   Write a function that takes in a pointer to the front of a linked list and returns 1 if all the nodes in the linked list are in sorted order (from smallest to largest, with repeats allowed), and 0 otherwise. The prototype is given below:

int isSorted(struct node* list) {

16.   Write a function that takes in a pointer to the head of a linked list, a value to insert into the list, val, and a location in the list in which to insert it, place, which is guaranteed to be greater than 1, and does the insertion. If place number of items aren’t in the list, just insert the item in the back of the list. You are guaranteed that the linked list into which the inserted item is being added is not empty. The prototype is given below:

void insertToPlace(struct node* list, int val, int place) {


17.   Write a function that operates on a linked list of integers. Your function should insert a new node containing the value 2 after every node that contains the value 4. Make use of the list node struct and function header below.

void list_42(struct node* list) {

Answer 1

17)

struct node* current = head;

struct node* temp;

while(current != NULL)

{

if(current->data == 4)

{

temp = malloc(sizeof(struct node));

temp->data = 2;

temp->next = current->next;

current->next = temp;

}

current = current->next;

}