#include

#include

struct Node$\{$

int mData;

struct Node$*$ mNext;

$\}$;

$//$ This function updates a singly linked list into a circular singly linked list

struct Node$*$ makeListCircular$($struct Node$*$ pHead$)\{$

$\}$

$//$ This function prints "numNodes" number of nodes in a circular linked list

void printCircularLinkedList$($struct Node$*$ pHead, int numNodes$)\{$

printf$("$Circular linked list $\%$d items

$",$numNodes$)$;

$//$ Start of your implementation

$//$ End of your implementation

printf$("$

$`")$;

$\}$

void printLinkedList$($struct Node$*$ pHead$)\{$

printf$("$Linked list:

$")$;

while $($pHead $!=$ NULL$)$

$\{$

printf$("\%$d $",$pHead$->$mData$)$;

pHead $=$ pHead$->$mNext;

$\}$

printf$("$

$")$;

$\}$

int main$($void$)\{$

struct Node$*$ n$1=($struct Node$*)$ malloc$($sizeof$($struct Node$))$;

struct Node$*$ n$2=($struct Node$*)$ malloc$($sizeof$($struct Node$))$;

struct Node$*$ n$3=($struct Node$*)$ malloc$($sizeof$($struct Node$))$;

struct Node$*$ n$4=($struct Node$*)$ malloc$($sizeof$($struct Node$))$;

struct Node$*$ n$5=($struct Node$*)$ malloc$($sizeof$($struct Node$))$;

struct Node$*$ n$6=($struct Node$*)$ malloc$($sizeof$($struct Node$))$;

if $(($n$1==$ NULL$)||$

$($n$2==$ NULL$)||$

$($n$3==$ NULL$)||$

$($n$4==$ NULL$)||$

$($n$5==$ NULL$)||$

$($n$6==$ NULL$))$

$\{$

printf$("$There is an error in memory allocation, exiting!

$")$;

return $-1$;

$\}$

n$1->$mData $=1$;

n$1->$mNext $=$ n$2$;

n$2->$mData $=2$;

n$2->$mNext $=$ n$3$;

n$3->$mData $=3$;

n$3->$mNext $=$ n$4$;

n$4->$mData $=4$;

n$4->$mNext $=$ n$5$;

n$5->$mData $=5$;

n$5->$mNext $=$ n$6$;

n$6->$mData $=6$;

n$6->$mNext $=$ NULL;

struct Node$*$ head $=$ n$1$;

$//$ Print #$1$

printLinkedList$($head$)$;

head $=$ makeListCircular$($head$)$;

printCircularLinkedList$($head$,20)$;

$//$ Print # $2$

n$1->$mNext $=$ NULL;

printLinkedList$($head$)$;

head $=$ makeListCircular$($head$)$;

printCircularLinkedList$($head$,20)$;

$//$ Print # $3$

head $=$ NULL;

printLinkedList$($head$)$;

head $=$ makeListCircular$($head$)$;

printCircularLinkedList$($head$,20)$;

return $0$;

$\}$