Circular linked list is a form of the linked list data structure where all nodes are connected as in a circle, whichmeans there is no NULL at the end. Circular lists are generally used in applications which needs to goaround the list repeatedly.struct Node * insertTONull (struct Node *last, int data)// This function is only for empty list11515struct Node insertStart (struct Node +last, int data)In this question, you are going to implement the insert functions of a circular linked list in C. TheNode struct, print function and the main function with its output is given below:struct Node{int data;struct Node *next;};struct Node insertEnd (struct Node *last, int data)void print(struct Node *tailNode)struct Node *p;if (tailNode -- NULL)struct Node * insertSubseq (struct Node *last, int data, int item)puts("Empty");return;p - tailNode → next;do{printf("%d ",p→data);p - p > next;while(p !- tailNode →next);void main(void){struct Node *tailNode - NULL;tailNode - insertTONull(tailNode, 6);tailNode - insertStart(tailNode, 4);tailNode - insertEnd (tailNode, 8);tailNode - insertEnd (tailNode, 12);tailNode - insertSubseq(tailNode, 9, 8);Output:4689 12print(tailNode);Please follow the rules given below:• Take an external pointer which points to the iast node of the list, not the head. This willhelp you to easily insert in the beginning or at the end of the list.• Fill the functions given below.• If the given search argument cannot be found in the list, insertSubseg function shouldissue an error message.

struct Node *insertTonull(struct Node *last, int data) { if (last != NULL) return last;…

Circular linked list is a form of the linked list data structure where all nodes are connected as in a circe, which means there is no NULL at the end. Circular lists are generally used in applications which needs to go around the list repeatedly. struct Node insertToNull (struct Node last, int data) I" This function is only for empty list struct Node • insertStart (struct Node last, int data) n this question, you are going to implement the insert functions of a circular linked ist in C. The Node struct, print function and the main function with its output is given below: struct Node int data; struct Node "next: struct Node. insertEnd (struet Node last, ant data) void print(struct Node "tailNode) struct Node "p; if (tallNode NULL) struct Node insertSubseg (struct Node last, int data, int item) puts("Empty"): return; p- tailNode + next; do printf("d ".padata); P-p+ next; hile(p t- tailINode next); void main(void) struct Node *tailNode - NULL; tailNode - insertToNull(tailNode, 6); tailNode - insertStart (tailNode, 4); tailNode - insertEnd(taiINode, 8); tailNode - insertEnd (tailNode, 12); tailNode - insertSubseq(tailNode, 9, 8); Output: 468912 print(tailNode): Please follow the rules given below. • Take an extemal pointer which points to n nes of the list, not the head. This will help you to easily insert in the beginning or at the end of the list. • F the functions given below. • I the given search argument cannot be found in the list, inserSuse function should issue an error message.

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 18SA