Lec 4 | Double Circular Linked List | Delete | Data Structures | C programming

​‪@VimalKaushik-g3t‬ Please Like, Share, and Subscribe. If any doubts or feedback, please comment below. In this video, we discussed about 1. Introduction to double circular linked list 2. Deletion in double circular linked list Here is the C program of how the deletion function works, #include (less than symbol)stdio.h(greater than symbol) #include (less than symbol)stdlib.h(greater than symbol) typedef struct dblcrl { struct dblcrl *plink; int data; struct dblcrl *nlink; }dblcrl; dblcrl *start = NULL, *last, *temp; int n, pos, elm; int main() { void create(); void display(); void delete(); int ch; while(1) { printf("1. Create\n"); printf("2. Display\n"); printf("3. Insert\n"); printf("4. Delete\n"); printf("5. Exit\n"); printf("Enter your choice: "); scanf("%d",&ch); switch(ch) { case 1 : create(); break; case 2 : display(); break; case 3 : insert(); break; case 4 : delete(); break; case 5 : exit(0); break; default: printf("Invalid Number\n"); } } return 0; } void create() { start = NULL; printf("Enter the total number of elements : "); scanf("%d",&n); printf("Enter the elements: \n"); for(int i = 0 ; i (less than symbol) n ; i++) { temp = (dblcrl*)malloc(sizeof(dblcrl)); scanf("%d",&temp- (greater than symbol)data); temp- (greater than symbol)plink = NULL; temp- (greater than symbol)nlink = NULL; if(start == NULL) { start = temp; last = temp; start- (greater than symbol)plink = last; last- (greater than symbol)nlink = start; } else { temp- (greater than symbol)plink = last; temp- (greater than symbol)nlink = start; last- (greater than symbol)nlink = temp; start- (greater than symbol)plink = temp; last = temp; } } printf("%d elements created successfully.\n",n); } void display() { if(start == NULL) { printf("List is empty\n"); return; } temp = start; do { printf("%d ", temp- (greater than symbol)data); temp = temp- (greater than symbol)nlink; } while(temp != start); printf("\n"); } void delete() { if(start == NULL) { printf("List is empty\n"); return; } int elm, flag = 0; printf("Enter element to delete: "); scanf("%d",&elm); if(start- (greater than symbol)data == elm) { temp = start; temp- (greater than symbol)nlink- (greater than symbol)plink = last; last- (greater than symbol)nlink = temp- (greater than symbol)nlink; start = start- (greater than symbol)nlink; if(n == 1) { start = NULL; } free(temp); flag++; } else { dblcrl *del = start; do { if(del- (greater than symbol)nlink- (greater than symbol)data == elm) { temp = del- (greater than symbol)nlink; del- (greater than symbol)nlink = temp- (greater than symbol)nlink; temp- (greater than symbol)nlink- (greater than symbol)plink = del; if(last == temp) { last = del; } free(temp); flag++; } del = del- (greater than symbol)nlink; }while(del != start); } if(flag == 0) { printf("Element not found\n"); } else { printf("%d deleted\n",elm); n--; } }