PROGRAM:
#include <stdio.h>
#include <stdlib.h>
struct node
int data;
struct node *next;
};
struct node *head = NULL;
struct node* createNode(int data)
struct node *newNode = (struct node*)malloc(sizeof(struct node));
newNode->data = data;
newNode->next = NULL;
return newNode;
void createList(int data)
head = createNode(data);
head->next = head;
void insertAtBeginning(int data)
struct node *newNode = createNode(data);
if (head == NULL)
head = newNode;
head->next = head;
else
newNode->next = head;
struct node *temp = head;
while (temp->next != head)
temp = temp->next;
temp->next = newNode;
head = newNode;
void insertAtEnd(int data)
struct node *newNode = createNode(data);
if (head == NULL)
head = newNode;
head->next = head;
}
else
struct node *temp = head;
while (temp->next != head)
temp = temp->next;
temp->next = newNode;
newNode->next = head;
void insertAtPosition(int data, int position) {
if (position < 1) {
printf("Invalid position\n");
return;
if (position == 1) {
insertAtBeginning(data);
return;
struct node *newNode = createNode(data);
struct node *temp = head;
int count = 1;
while (count < position - 1 && temp->next != head) {
temp = temp->next;
count++;
if (count == position - 1) {
newNode->next = temp->next;
temp->next = newNode;
else {
printf("Invalid position\n");
void deleteAtBeginning() {
if (head == NULL) {
printf("List is empty\n");
return;
if (head->next == head) {
free(head);
head = NULL;
else {
struct node *temp = head;
head = head->next;
struct node *last = head;
while (last->next != temp) {
last = last->next;
}
last->next = head;
free(temp);
void deleteAtEnd() {
if (head == NULL) {
printf("List is empty\n");
return;
if (head->next == head) {
free(head);
head = NULL;
else {
struct node *temp = head;
while (temp->next->next != head) {
temp = temp->next;
free(temp->next);
temp->next = head;
void deleteAtPosition(int position) {
if (position < 1) {
printf("Invalid position\n");
return;
if (position == 1) {
deleteAtBeginning();
return;
struct node *temp = head;
int count = 1;
while (count < position - 1 && temp->next != head) {
temp = temp->next;
count++;
if (count == position - 1) {
struct node *toDelete = temp->next;
temp->next = toDelete->next;
free(toDelete);
else
printf("Invalid position\n");
void display()
{
if (head == NULL)
printf("List is empty\n");
return;
struct node *temp = head;
do
printf("%d ", temp->data);
temp = temp->next;
} while (temp != head);
printf("\n");
int main() {
int choice, data, position;
while (1) {
printf("\nCircular Linked List Operations:\n");
printf("1. Create List\n");
printf("2. Insert at Beginning\n");
printf("3. Insert at End\n");
printf("4. Insert at Position\n");
printf("5. Delete at Beginning\n");
printf("6. Delete at End\n");
printf("7. Delete at Position\n");
printf("8. Display\n");
printf("9. Exit\n");
printf("Enter your choice: ");
scanf("%d", &choice);
switch (choice) {
case 1:
printf("Enter data for the first node: ");
scanf("%d", &data);
createList(data);
break;
case 2:
printf("Enter data to insert at beginning: ");
scanf("%d", &data);
insertAtBeginning(data);
break;
case 3:
printf("Enter data to insert at end: ");
scanf("%d", &data);
insertAtEnd(data);
break;
case 4:
printf("Enter data to insert: ");
scanf("%d", &data);
printf("Enter position: ");
scanf("%d", &position);
insertAtPosition(data, position);
break;
case 5:
deleteAtBeginning();
break;
case 6:
deleteAtEnd();
break;
case 7:
printf("Enter position to delete: ");
scanf("%d", &position);
deleteAtPosition(position);
break;
case 8:
display();
break;
case 9:
exit(0);
default:
printf("Invalid choice\n");
return 0;
}
OUTPUT:
Circular Linked List Operations:
1. Create List
2. Insert at Beginning
3. Insert at End
4. Insert at Position
5. Delete at Beginning
6. Delete at End
7. Delete at Position
8. Display
9. Exit
Enter your choice: 1
Enter data for the first node: 10
Circular Linked List Operations:
1. Create List
2. Insert at Beginning
3. Insert at End
4. Insert at Position
5. Delete at Beginning
6. Delete at End
7. Delete at Position
8. Display
9. Exit
Enter your choice: 2
Enter data to insert at beginning: 1
Circular Linked List Operations:
1. Create List
2. Insert at Beginning
3. Insert at End
4. Insert at Position
5. Delete at Beginning
6. Delete at End
7. Delete at Position
8. Display
9. Exit
Enter your choice: 2
Enter data to insert at beginning: 2
Circular Linked List Operations:
1. Create List
2. Insert at Beginning
3. Insert at End
4. Insert at Position
5. Delete at Beginning
6. Delete at End
7. Delete at Position
8. Display
9. Exit
Enter your choice: 8
2 1 10
Circular Linked List Operations:
1. Create List
2. Insert at Beginning
3. Insert at End
4. Insert at Position
5. Delete at Beginning
6. Delete at End
7. Delete at Position
8. Display
9. Exit
Enter your choice: 21
Invalid choice
Circular Linked List Operations:
1. Create List
2. Insert at Beginning
3. Insert at End
4. Insert at Position
5. Delete at Beginning
6. Delete at End
7. Delete at Position
8. Display
9. Exit
Enter your choice: 3
Enter data to insert at end: 3
Circular Linked List Operations:
1. Create List
2. Insert at Beginning
3. Insert at End
4. Insert at Position
5. Delete at Beginning
6. Delete at End
7. Delete at Position
8. Display
9. Exit
Enter your choice: 3
Enter data to insert at end: 4
Circular Linked List Operations:
1. Create List
2. Insert at Beginning
3. Insert at End
4. Insert at Position
5. Delete at Beginning
6. Delete at End
7. Delete at Position
8. Display
9. Exit
Enter your choice: 8
2 1 10 3 4
Circular Linked List Operations:
1. Create List
2. Insert at Beginning
3. Insert at End
4. Insert at Position
5. Delete at Beginning
6. Delete at End
7. Delete at Position
8. Display
9. Exit
Enter your choice: 4
Enter data to insert: 5
Enter position: 3
Circular Linked List Operations:
1. Create List
2. Insert at Beginning
3. Insert at End
4. Insert at Position
5. Delete at Beginning
6. Delete at End
7. Delete at Position
8. Display
9. Exit
Enter your choice: 8
2 1 5 10 3 4
Circular Linked List Operations:
1. Create List
2. Insert at Beginning
3. Insert at End
4. Insert at Position
5. Delete at Beginning
6. Delete at End
7. Delete at Position
8. Display
9. Exit
Enter your choice: 5
Circular Linked List Operations:
1. Create List
2. Insert at Beginning
3. Insert at End
4. Insert at Position
5. Delete at Beginning
6. Delete at End
7. Delete at Position
8. Display
9. Exit
Enter your choice: 8
1 5 10 3 4
Circular Linked List Operations:
1. Create List
2. Insert at Beginning
3. Insert at End
4. Insert at Position
5. Delete at Beginning
6. Delete at End
7. Delete at Position
8. Display
9. Exit
Enter your choice: 6
Circular Linked List Operations:
1. Create List
2. Insert at Beginning
3. Insert at End
4. Insert at Position
5. Delete at Beginning
6. Delete at End
7. Delete at Position
8. Display
9. Exit
Enter your choice: 8
1 5 10 3
Circular Linked List Operations:
1. Create List
2. Insert at Beginning
3. Insert at End
4. Insert at Position
5. Delete at Beginning
6. Delete at End
7. Delete at Position
8. Display
9. Exit
Enter your choice: 7
Enter position to delete: 2
Circular Linked List Operations:
1. Create List
2. Insert at Beginning
3. Insert at End
4. Insert at Position
5. Delete at Beginning
6. Delete at End
7. Delete at Position
8. Display
9. Exit
Enter your choice: 8
1 10 3
Circular Linked List Operations:
1. Create List
2. Insert at Beginning
3. Insert at End
4. Insert at Position
5. Delete at Beginning
6. Delete at End
7. Delete at Position
8. Display
9. Exit
Enter your choice: 9
