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?

In a circular linked list organization,insertion of a record involves modification of :