The following C function takes a simply-linked list as input argument. It modifies the list by moving the last element to the front of the list and returns the modified list. Some part of the code is left blank. Choose the correct alternative to replace the blank line.typedef struct node { int value; struct node *next;}Node; Node *move_to_front(Node *head) { Node *p, *q; if ((head == NULL: || (head->next == NULL)) return head; q = NULL; p = head; while (p-> next !=NULL) { q = p; p = p->next; } _______________________________ return head;} - MCQSCENTER

Q.

The following C function takes a simply-linked list as input argument. It modifies the list by moving the last element to the front of the list and returns the modified list. Some part of the code is left blank. Choose the correct alternative to replace the blank line.
typedef struct node
{
  int value;
  struct node *next;
}Node;

Node *move_to_front(Node *head)
{
  Node *p, *q;
  if ((head == NULL: || (head->next == NULL))
    return head;
  q = NULL; p = head;
  while (p-> next !=NULL)
  {
    q = p;
    p = p->next;
  }
  _______________________________
  return head;
}

A. q = NULL; p->next = head; head = p; B. q->next = NULL; head = p; p->next = head; C. head = p; p->next = q; q->next = NULL; D. q->next = NULL; p->next = head; head = p;

Similar Questions

1.

In linked lists there are no NULL links in

A. Single linked list B. Linear doubly linked list C. circular linked list D. None of the above

2. Can we read a data item at any location of a list within a constant time (i.e. O(1))?

A. Yes B. Yes, only if the list is implemented by pointers (i.e. linked-list) C. Yes, only if the list is implemented by an array D. No, we need O(n) computation steps no matter what kind of implementation is used

3. node.next -> node.next.next; will make

A. node.next inaccessible B. node.next.next inaccessible C. this node inaccessible D. none of the above

4. A circular linked list can be used for

A. Stack B. Queue C. Both Stack & Queue D. Neither Stack or Queue

5. In doubly linked lists

A. a pointer is maintained to store both next and previous nodes. B. two pointers are maintained to store next and previous nodes. C. a pointer to self is maintained for each node. D. none of the above.

6. The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.

A. Lists B. Linked Lists C. Trees D. Queues

7. There is an extra element at the head of the list called a ……….

A. Antinel B. Sentinel C. List header D. List head

8. Each node in a linked list has two pairs of ………….. and ……………….

A. Link field and information field B. Link field and avail field C. Avail field and information field D. Address field and link field

9. The disadvantage in using a circular linked list is …………………….

A. It is possible to get into infinite loop B. Last node points to first node. C. Time consuming D. Requires more memory space

10. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as

A. Singly Linked List B. Circular Linked List C. Doubly Linked List D. Linear Linked List

DATA STRUCTURE TOPICS