The following C function takes a single-linked list of integers as a parameter and rearranges the elements of the list. The function is called with the list containing the integers 1,2,3,4,5,6,7 in the given order. What will be the contents of the list after the function completes execution?

struct node { 
    int value; 
    struct node *next; 
}; 

Void rearrange (struct node *list ){ 
    struct node *p, * q; 
    int temp; 
    if( !list || !list-> next) return; 
    p = list; q = list->next; 
    while (q) { 
      temp = p->value; 
      p-> value = q ->value; 
      q-> value = temp; 
      p = q-> next; 
      q = p ? p->next : 0; 
    } 
}

A circularly linked list is used to represent a Queue. A single variable p is used to access the Queue. To which node should p point such that both the operations enQueue and deQueue can be performed in constant time?

Consider the function f defined below.

struct item { 
      int data; 
      struct item * next; 
}; 

int f(struct item *p) { 
      return ((p == NULL) || (p ->next == NULL) || 
        ((p->data <= p -> next -> data) && 
        f(p-> next))); 
}

For a given linked list p, the function f returns 1 if and only if

Linked lists are not suitable data structures of which one of the following problems?