Lec 4 | Circular Linked List | Deletion | Data Structures

‪@VimalKaushik-g3t‬ Please Like, Share, and Subscribe. If any doubts or feedback, please comment below. In this video, we discussed about 1. Introduction to Circular Linked List 2. Deleting a node in a Circular Linked List Here is the logic for the deletion function, void deletion() { int flag = 0; if(last == NULL) { printf("Empty List.\n"); return; } printf("Enter element to delete:\n"); scanf("%d",&elm); if(elm == last-(greater than symbol)link-(greater than symbol)data) { temp = last-(greater than symbol)link; last-(greater than symbol)link = temp-(greater than symbol)link; if(n==1) { last = NULL; } free(temp); flag++; } else { crllst *del = last-(greater than symbol)link; do { if(elm == del-(greater than symbol)link-(greater than symbol)data) { temp = del-(greater than symbol)link; del-(greater than symbol)link = temp-(greater than symbol)link; if(temp == last) { last = del; } free(temp); flag++; } del = del-(greater than symbol)link; }while(del-(greater than symbol)link != last-(greater than symbol)link); } n--; if(flag == 0) { printf("%d not found.\n",elm); } else { printf("%d deleted.\n",elm); } }