Write a program that create a circular linked list of 5 elements Solution /* * C

Question

Write a program that create a circular linked list of 5 elements

Explanation / Answer

/* * C Program to Demonstrate Circular Single Linked List */ #include #include struct node { int data; struct node *link; }; struct node *head = NULL, *x, *y, *z; void create(); void ins_at_beg(); void ins_at_pos(); void del_at_beg(); void del_at_pos(); void traverse(); void search(); void sort(); void update(); void rev_traverse(struct node *p); void main() { int ch; printf(" 1.Creation 2.Insertion at beginning 3.Insertion at remaining"); printf(" 4.Deletion at beginning 5.Deletion at remaining 6.traverse"); printf(" 7.Search 8.sort 9.update 10.Exit "); while (1) { printf(" Enter your choice:"); scanf("%d", &ch); switch(ch) { case 1: create(); break; case 2: ins_at_beg(); break; case 3: ins_at_pos(); break; case 4: del_at_beg(); break; case 5: del_at_pos(); break; case 6: traverse(); break; case 7: search(); break; case 8: sort(); break; case 9: update(); break; case 10: rev_traverse(head); break; default: exit(0); } } } /*Function to create a new circular linked list*/ void create() { int c; x = (struct node*)malloc(sizeof(struct node)); printf(" Enter the data:"); scanf("%d", &x->data); x->link = x; head = x; printf(" If you wish to continue press 1 otherwise 0:"); scanf("%d", &c); while (c != 0) { y = (struct node*)malloc(sizeof(struct node)); printf(" Enter the data:"); scanf("%d", &y->data); x->link = y; y->link = head; x = y; printf(" If you wish to continue press 1 otherwise 0:"); scanf("%d", &c); } } /*Function to insert an element at the begining of the list*/ void ins_at_beg() { x = head; y = (struct node*)malloc(sizeof(struct node)); printf(" Enter the data:"); scanf("%d", &y->data); while (x->link != head) { x = x->link; } x->link = y; y->link = head; head = y; } /*Function to insert an element at any position the list*/ void ins_at_pos() { struct node *ptr; int c = 1, pos, count = 1; y = (struct node*)malloc(sizeof(struct node)); if (head == NULL) { printf("cannot enter an element at this place"); } printf(" Enter the data:"); scanf("%d", &y->data); printf(" Enter the position to be inserted:"); scanf("%d", &pos); x = head; ptr = head; while (ptr->link != head) { count++; ptr = ptr->link; } count++; if (pos > count) { printf("OUT OF BOUND"); return; } while (c link; c++; } y->link = x; z->link = y; } /*Function to delete an element at any begining of the list*/ void del_at_beg() { if (head == NULL) printf(" List is empty"); else { x = head; y = head; while (x->link != head) { x = x->link; } head = y->link; x->link = head; free(y); } } /*Function to delete an element at any position the list*/ void del_at_pos() { if (head == NULL) printf(" List is empty"); else { int c = 1, pos; printf(" Enter the position to be deleted:"); scanf("%d", &pos); x = head; while (c link; c++; } y->link = x->link; free(x); } } /*Function to display the elements in the list*/ void traverse() { if (head == NULL) printf(" List is empty"); else { x = head; while (x->link != head) { printf("%d->", x->data); x = x->link; } printf("%d", x->data); } } /*Function to search an element in the list*/ void search() { int search_val, count = 0, flag = 0; printf(" enter the element to search "); scanf("%d", &search_val); if (head == NULL) printf(" List is empty nothing to search"); else { x = head; while (x->link != head) { if (x->data == search_val) { printf(" the element is found at %d", count); flag = 1; break; } count++; x = x->link; } if (x->data == search_val) { printf("element found at postion %d", count); } if (flag == 0) { printf(" element not found"); } } } /*Function to sort the list in ascending order*/ void sort() { struct node *ptr, *nxt; int temp; if (head == NULL) { printf("empty linkedlist"); } else { ptr = head; while (ptr->link != head) { nxt = ptr->link; while (nxt != head) { if (nxt != head) { if (ptr->data > nxt->data) { temp = ptr->data; ptr->data = nxt->data; nxt->data = temp; } } else { break; } nxt = nxt->link; } ptr = ptr->link; } } } /*Function to update an element at any position the list*/ void update() { struct node *ptr; int search_val; int replace_val; int flag = 0; if (head == NULL) { printf(" empty list"); } else { printf("enter the value to be edited "); scanf("%d", &search_val); fflush(stdin); printf("enter the value to be replace "); scanf("%d", &replace_val); ptr = head; while (ptr->link != head) { if (ptr->data == search_val) { ptr->data = replace_val; flag = 1; break; } ptr = ptr->link; } if (ptr->data == search_val) { ptr->data = replace_val; flag = 1; } if (flag == 1) { printf(" UPdate sucessful"); } else { printf(" update not successful"); } } } /*Function to display the elements of the list in reverse order*/ void rev_traverse(struct node *p) { int i = 0; if (head == NULL) { printf("empty linked list"); } else { if (p->link != head) { i = p->data; rev_traverse(p->link); printf(" %d", i); } if (p->link == head) { printf(" %d", p->data); } } }

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.