Project on the topic based on circular singly linked list

1. CIRCULAR SINGLY LINKED LIST
Vrand K. Mandora
1NT21AI066

2. CIRCULAR SINGLY LINKED LIST
DATA *LINK DATA *LINK DATA *LINK
TAIL

4. CSLL DISPLAY
//Display
void display()
{
struct node *p=tail->link;
Do{
Printf(“%d”,p->data);
P=p->link
}
While(p!=tail->link);
}
• Here we are assigning temp pointer which basically points to the new node
created with malloc
Size of memory is
the size of struct
node
Struct node* is a datatype
cast for p variable

5. printf(“enter data”)
scanf(“%d”,&p->data);
temp->link=NULL;
100
10 0
temp
100
data *link