## MCQ On Linked List - Data Structure

21. Which of the following points is/are true about Linked List data structure when it is compared with array

View Answer

22. Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?

View Answer

23. Given pointer to a node X in a singly linked list. Only one pointer is given, pointer to head node is not given, can we delete the node X from given linked list?

View Answer

24. The following function reverse() is supposed to reverse a singly linked list. There is one line missing at the end of the function.What should be added in place of "/*ADD A STATEMENT HERE*/", so that the function correctly reverses a linked list.

struct node { int data; struct node* next; }; static void reverse(struct node** head_ref) { struct node* prev = NULL; struct node* current = *head_ref; struct node* next; while (current != NULL) { next = current->next; current->next = prev; current = next; } /*ADD A STATEMENT HERE*/ }

View Answer

25. he 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; } }

View Answer

**Also check : **