Circular Linked Lists: Operations in C Language

[@CodeWithHarry]

Kis kisne yaha tak ke saare videos dekhe? I am planning to upload some info content on Instagram as well! Follow kar lena :) Instagram: instagram.com/codewithharry

[@divyankapatil925]

me

[@divyankapatil925]

me

[@divyankapatil925]

harry sir what is your mother tongue

[@Ur.Podcast_Buddy]

Nlp pe bhi video banaoo na plz

[@talibahemad8632]

Bhai please make react.js in one video

[@manushpatel4056]

Yesterday I was chatting with my friend about online studies and he asked me that who is your favorite teacher and I told him Harry sir. Then he searched your channel and he also started to see your videos regularly like me!! And had started to learn python.

[@BorutoOtsutsuki__]

Not a good thing , competition will increase.

[@educated4991]

​@@BorutoOtsutsuki__inteligent bolthe 😂

[@RohitSharma-cu5fk]

Kal hi bataya dost ko , aur ab woh regularly dekhne bhi lag gaya , waah😂😂

[@aqdas.mirza.]

@@RohitSharma-cu5fkmai bhi , pr ab mai nhi dekhta🥲

[@Pranay_9]

@@RohitSharma-cu5fk came to comment same thing

[@AdarshSingh-cb5yf]

Sir mere college wale bol rhe hai ki data structure bahut hard hai ........ Aur sir unke padhane se to hard lagta bhi hai LEKIN AAP PADHA RHE HAI TO DS AND ALGO EKDAM हलुआ LAG RHA ...HAI........ SIR I AM IN BCA SECOND YEAR AND I AM FOLLOWING THIS SERIES SPECIALLY FOR MY PLACEMENT..... THANK YOU SIR 😍😍❤️❤️❤️

[@Golukumar81999]

Sir.. I am golu kumar from bihar muzaffarpur.... data structure ka full course upload kijiyega dusre course ki tarah.. Kyuki college me teacher ka lecture sun k boring v lagta hai, samaz me v nhi aata hai ... Or aapka video dekh k lagta hai ki ye to kuch v nhi hai.. So i requested to you sir.. please upload full course of data structure..

[@chetandhawne9834]

I have started watching your videos by this data structures and algorithms playlist. I liked it very much . You teach too the much with simple notes. I have also started watching some other playlists as well.. thanks for ur support..🙏❤️

[@dheerajsaraswat227]

// insert at last of the circular linklist node *insertatlast(node *head, int data) { node *ptr = new node(); ptr->data = data; node *p = head; while (p->next != head) { p = p->next; } ptr->next = p->next; p->next = ptr; return head; }

[@dheerajsaraswat227]

Task completed from my side harry bhai, i can done all remaning three case

[@Shubham-jz7ec]

PLZZ keep commenting guys to show your support. Harry Bhai totally deserves it👍

[@biker_karanpal]

Are Harry bhai ka "Shubham" mil gya ab bacha "Rohan das" Hi Shubham 😂

[@anshumansrivastava7840]

Sir i watched DS video till last... Really very helpful videos.... Plz guys like kr diya kro... Sir do very much hard work for us

[@Newone-io6og]

Bhaya, app ke pichle video dekhne ke baad program banaya, confidence boost hua, Thank you bhaya.

[@being1better801]

Just want to share one tip which I used to understand about insertion of elements on head. May not be helpful for you. 1) start loop from p->next(same Harry did) 2)then same as insertion on element at a given index wala concept in singly linked list.

[@furzi1432]

Thankyou very much bhaiya pichle video me itna accha samajhaya aapne ki ye video dekhe bina hi program ban gaya thankyou very much ❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️🙏🙏🙏🙏🙏🙏🙏🎉🎉🎉🎉 Mere sath pahli baar esa hua ki itne bade program bina koi error ke run ho gaya.. thankyou bhaiya 🙏🙏🙏🙏

[@gamingworld203]

its ok bhai keep it up ny the way this is my second channel...

[@alone_man3198]

Thanks for your kindness that u are sharing your knowledge free to is..🙏🙏

[@biswanathmodak110]

If you write the while loop like this then you don't need to give any push, 7:19 struct node *p=head; while( p->next != head) { p = p->next; }

[@vinayghosh5584]

Thank U , Harry U R Doing Great Job , God Bless U , You Will Be One Of Most Successful KZbinr. Coz You are Spreading Free Knowledge and No Premium Courses, And in Future do not make any premium courses plz,, Like Other KZbinrs Thank You for Making These Type of free Courses

[@FitnessLoverkanpuriya]

Sir your course are very very helpful ❤️thanku sir ❤️you are the my best teacher

[@bulukivine8238]

The respect i have for you is enormous harry bhai

[@chirayujain5872]

Sir u are just awesome teacher 😃😃😇😇 You are my inspiration in the field of coding 🥰🥰....

[@KHWAJAABDULSAMAD]

I used this as my Code To Insert at beginning and it worked : struct Node *InsertionAtHead(struct Node *head, int value) { struct Node * ptr; ptr = (struct Node *) malloc (sizeof(struct Node)); ptr->data = head->data; head->data = value; ptr->next = head->next; head->next = ptr; return head ; }

[@sharjeelashraf9887]

Enjoying learning the DSA with this playlist. Good work keep it up bro

[@RajdeepDas-oo5gz]

Harry bhai Zindaabaad

[@shantanubalkawade7025]

THANK YOU FOR TEACHING US FOR FREE 😄 CODE RUNS BUT GIVES THIS WARNING !! (comparison between pointer and integer while (p!=head)) CircularLinkedList.c:10:6: warning: type of 'head' defaults to 'int' [-Wimplicit-int] void printList(head) ^~~~~~~~~ CircularLinkedList.c:12:20: warning: initialization of 'struct node *' from 'int' makes pointer from integer without a cast [-Wint-conversion] struct node *p=head; ^~~~ CircularLinkedList.c:14:13: warning: comparison between pointer and integer while (p!=head) ^~ Element :32 Element :65 Element :89 Element :12

[@mukeshchauhan2354]

kindly add one video on daily basis in this series . Your concept is clean and compact.

[@knightysoul6818]

circular link list all operation #include #include struct node{ int data; struct node*next; }; void linklisttraversal(struct node*head){ struct node*ptr=head; do{ printf("%d--",ptr->data); ptr=ptr->next; }while(ptr!=head); } struct node*insertatfirst(struct node*head,int data){ struct node*p=(struct node*)malloc(sizeof(struct node)); struct node*q=head->next; while(q->next!=head){ q=q->next; } p->next=head; q->next=p; p->data=data; head=p; return head; } struct node*insertatindex(struct node*head,int data,int index){ struct node*p=(struct node*)malloc(sizeof(struct node)); struct node*q=head; int i=0; while(i!=index-1){ q=q->next; i++; } p->next=q->next; q->next=p; p->data=data; return head; } struct node*insertatend(struct node*head,int data){ struct node*p=(struct node*)malloc(sizeof(struct node)); struct node*ptr=head->next; while(ptr->next!=head){ ptr=ptr->next; } ptr->next=p; p->next=head; p->data=data; return head; } struct node*deleteatfirst(struct node*head){ struct node*p=head; struct node*q=head->next; while(q->next!=head){ q=q->next; } q->next=p->next; head=head->next; free(p); return head; } struct node*deleteatindex(struct node*head,int index){ struct node*p=head; struct node*q=head->next; int i=0; while(i!=index-1){ q=q->next; p=p->next; i++;} p->next=q->next; free(q); return head; } int main(){ struct node*head=(struct node*)malloc(sizeof(struct node)); struct node*second=(struct node*)malloc(sizeof(struct node)); struct node*third=(struct node*)malloc(sizeof(struct node)); struct node*fourth=(struct node*)malloc(sizeof(struct node)); head->data=5; head->next=second; second->data=10; second->next=third; third->data=15; third->next=fourth; fourth->data=20; fourth->next=head; linklisttraversal(head); printf("after insert"); head=insertatfirst(head,200); linklisttraversal(head); printf("insert at index"); head=insertatindex(head,100,3); linklisttraversal(head); printf("last insert"); head=insertatend(head,900); linklisttraversal(head); printf("delet first"); head=deleteatfirst(head); linklisttraversal(head); printf("delete at index"); head=deleteatindex(head,1); linklisttraversal(head); }

[@Anonymous-pp8kg]

Thx bhai

[@heeru379]

Extremely helpful tutorial. Thank u harry bhai. //I did the insertAtFirst of circular linked list in O(1); void Node::InsertAtFirst(int data){ Node * ptr = new Node; ptr->data = data; current->next = ptr; //current is basically last node of the list. ptr->next = head; head = ptr; }

[@knowtechwithaman7254]

great video sir, you make things so easy to understand.

[@anshumanp74]

Bhai i suggest ki har topic cover karne baad uska ek question set bana kar upload kardo jissme basic to advance questions ho taki bacche practice bhi kar sake U dont have to explain circular LL insertion as its quite easy to implement if one understood singly LL properly

[@rutujaganje2504]

Very helpful this series Really very thank you ☺️

[@sanketsuryawanshi]

Awesome Harry bhai 🔥🔥🔥

[@projjalsarkar814]

Thank you Harry Sir❤.I am learning everyday through your videos

[@humblef00l]

thank you for your efforts really appreciate it!

[@Engineer78206]

thankyou harry sir:)

[@bafikrayfellows2146]

i watched all videos till this one. 6000 hours completed soon inshallah brother fiker not take honsla

[@fatherofcommunists9484]

Maksad nhi bhulna

[@tanishqsahu5382]

@fatherofcommunists9484😂

[@maazshaikh2079II]

​@@fatherofcommunists9484 idhar bhi agaye Instagram ke 15 year olds. Dubara reels scroll karna shuru kar de bete itna tera attention span nahi hai pura playlist complete kar ne ka, waise bhi bada hoke Zomato delivery boy hi banna hai tujhe, programming samajh ne se rahi tujhe

[@satyendrasoni3648]

tomorrow my exam and today i am seeing this video.it is very beneficial for me .thank you sir

[@dheerajsaraswat227]

//delete first node of the circular linked list node *deleteatfirst(node *head) { node *ptr = head; while (ptr->next != head) { ptr = ptr->next; } node *p = head; ptr->next = head->next; head = head->next; free(p); return head; }

[@officiallegenderyboy8138]

Instead of printing single time before loop we can simply say that ptr->next!=head

[@pulkit8133]

Thank you sir :)

[@Nitin_Chittoria]

East or west Harry Sir is the best

[@garvilshah1035]

I like this series the best. Good Job Harry sir

[@engineerbhai7642]

Thank you so much Harry Bhai. You are genius and excellent programmer in the world.

[@ashutoshpotdar7411]

Keep this playlist as you want harry bhai

[@nsptech9773]

Keep going 👍

[@ChSajjan]

Keep going 🙏

[@studynewthings1727]

I am enjoying the video.

[@mrfaizyvlog]

Harry bhai❤️ love from pakistan

[@ShaksD-vf3go]

Goat=harry bhai❤❤❤

[@soundaryadash5050]

Great video sir , It is very easy to understand 😍

[@arunbaghelvlogs3350]

👋 hello

[@silentmahi3030]

Thank you Harry Sir😇

[@motivationalStuffVideos]

And thanks for making my concept clear

[@lopamudradey5492]

really great explanation .

[@udaykirankavaturu6942]

Harry bhaiya done with this thank you

[@spurtinarkhedkar4122]

we can also do insertion at 1st node by taking head and last node as argument struct Node *insertBegin(struct Node *head, struct Node *last, int data) { struct Node *ptr = (struct Node *)malloc(sizeof(struct Node)); // struct Node* p ptr->data = data; ptr->next = last->next; last->next = ptr; return ptr; }

[@bhuvandahal421]

Or by struct Node * insertNodeAtFirst(struct Node *head, int value) { struct Node *ptr = (struct Node *) malloc(sizeof(struct Node)); ptr->data = head->data; head->data = value; ptr->next = head->next; head->next = ptr; return head; }

[@anmolgumbhir2037]

Harry please make an video of XML in one video with hand written notes .

[@aasthagambhir1064]

Yes sir please

[@studysmarter161]

I also want XML in one video.

[@user-rf3he9uv5m]

thankyou @code with harry

[@sudarshanmhaisdhune1039]

Great logic! 💗

[@Anuhyaje]

thank you very much for this playlist

[@72.varmayash24]

bhai aapke sabhi videos bahut mast hote he or jitna teachers nahi acche se explain krte utna aap krte ho thanks for a every video .

[@nikhilraj1842]

19:41 Welcome Harry Bhai

[@royfamily9273]

Thanks Harry Bhaiya

[@prathampatel3767]

Great video sir.. doing great job.. but tell you one thing No one Literally no one Harry Bhai: Free course Handwritten notes 😂😂

[@rgenx06]

True no one gives handwritten notes

[@shubhamverma865]

Nice work sir ji ♥️

[@victorb22622]

10:52 Harry ,don't you think , you could have skipped these video as all these had been discussed in earlier video .

[@rajbannasa7662]

very well explained sir , thank you so much sir

[@codewithharryfanchannel559]

Thank you sir.

[@lifewithrohan6900]

For those who wants DELETION_AT_INDEX in circular linked list // Deletion at any index in circular linked list struct node* deletionatindex(struct node* head, int index){ struct node*p= head; struct node* q= head->next; for(int i =0; i< index-1; i++){ q=q->next; p=p->next; } p->next=q->next; free(q); return head; }

[@techgourab]

7:24 do { printf("Element : %d ",ptr->data); ptr=ptr->next; }while (ptr!=head);

[@MR-re8pq]

Sorry bhaiya I don't Use Instagram 😭😭 But I liked this NICE 🤗VIDEO...

[@PranshuVashishtha]

Bro I am the biggest fan of yours... Bri agr mujhe aaj kuch bhe coding aate hai vo sirf aapke vajha se aate hai... Bro I am only 14 and know how to develop html sites with css but I am not so good in js😅😅 but I am sure I will learn it from your tutorials..... Bro but I need your help..... Bro I want to make a app like "zoom" please make a video on that topic I will be very thank full to you if you do that..... And you are the best...love from Uttarakhand

[@sanketsuryawanshi]

Harry bhai wants extra problem on linked list as per placement

[@arpanchaudhuri8486]

Thank You Bhaiya!!!

[@iamjohn7]

today i am watching this video exactly after 4 years :)

[@angryprash3684]

Great fan sir

[@ShikharMaurya]

Thanks Harry bro 👍

[@Sans_K5]

thanks_Sir💜

[@dheerajsaraswat227]

// delete a last node of the cicular linkedlist node*deletelastnode(node*head){ node*p=head; node*q=head->next; while (q->next!=head) { p=p->next; q=q->next; } p->next=head; free(q); return head; }

[@lifewithrohan6900]

For those who want DELETION_AT_LASTNODE in Circular linked list // Deletion of last node in circular linked list struct node* deletionoflastnode(struct node* head){ struct node* p= head; struct node*q= head->next; while(q->next!= head){ p=p->next; q=q->next; } if(q->next==head){ p->next=head; free(q); return head; } }

[@sahilwagh7730]

thanks bro

[@lifewithrohan6900]

@@sahilwagh7730 welcome !

[@bhuvandahal421]

There is no need to use if

[@vishalgupta8243]

Thanks

[@lifewithrohan6900]

For those who wants code for INSERTION_AFTER_NODE in circular linked list // Insertion after node in circular linked list struct node* insertionafternode(struct node* head, int data , struct node* prevnode){ struct node* ptr= (struct node*) malloc (sizeof(struct node)); struct node*p= head; while(p!= prevnode){ p=p->next; } if(p==prevnode){ ptr->next=p->next; p->next=ptr; ptr->data=data; } return head; }

[@techskills]

great sir .great jobe.👍

[@dheerajsaraswat227]

dynamic memory allocation in c language is very irritating but it in cpp it's very simple like that ----- node *head=new node();

[@shivanshutyagi83]

Harry bhai 👋👋

[@Shivamgarg6897]

Please make a video on How much Java is required for Android devlopment and is kotlin going to replace Java?

[@shamigaming6270]

Good work

[@rudrakalyan4567]

tkank you sir

[@mandlikaditi5158]

11:34 Yaha pr struct Node*p=head ->next kyu? struct Node*p=head bhi toh kr sakte hai n?

[@nisomsom]

then you have to use do while

[@youthteachsupport]

#include #include struct Node { int data; struct Node *next; }; void linkedListTraversal(struct Node *ptr) { while (ptr != NULL) { printf("Element: %d ", ptr->data); ptr = ptr->next; } } // Case 1: Deleting the first element from the linked list struct Node * deleteFirst(struct Node * head){ struct Node * ptr = head; head = head->next; free(ptr); return head; } // Case 2: Deleting the element at a given index from the linked list struct Node * deleteByIndex(struct Node * head, int index){ struct Node *p = head; struct Node *q = head->next; for (int i = 0; i < index-1; i++) { p = p->next; q = q->next; } p->next = q->next; free(q); return head; } // Case 3: Deleting the last element struct Node * deleteAtLast(struct Node * head){ struct Node *p = head; struct Node *q = head->next; while(q->next !=NULL) { p = p->next; q = q->next; } p->next = NULL; free(q); return head; } // Case 4: Deleting the element with a given value from the linked list struct Node * deleteByValue(struct Node * head, int value){ struct Node *p = head; struct Node *q = head->next; while(q->data!=value && q->next!= NULL) { p = p->next; q = q->next; } if(q->data == value){ p->next = q->next; free(q); } return head; } int main() { struct Node *head; struct Node *second; struct Node *third; struct Node *fourth; // Allocate memory for nodes in the linked list in Heap head = (struct Node *)malloc(sizeof(struct Node)); second = (struct Node *)malloc(sizeof(struct Node)); third = (struct Node *)malloc(sizeof(struct Node)); fourth = (struct Node *)malloc(sizeof(struct Node)); // Link first and second nodes head->data = 4; head->next = second; // Link second and third nodes second->data = 3; second->next = third; // Link third and fourth nodes third->data = 8; third->next = fourth; // Terminate the list at the third node fourth->data = 1; fourth->next = NULL; printf("Linked list before deletion "); linkedListTraversal(head); // head = deleteFirst(head); // For deleting first element of the linked list // head = deleteByIndex(head, 2); head = deleteAtLast(head); printf("Linked list after deletion "); linkedListTraversal(head); return 0; } There is an error in your code. You have two functions named deleteAtIndex, which is not allowed in C. You need to rename one of them to avoid the naming conflict. For example, you can rename deleteAtIndex for deleting a given index to deleteByIndex. Here's the updated code: solvethis issue

[@shashankkkk]

kya mast padhate ho bhaiya

[@eklavya250]

This man deserves massive respect🤩🤩

[@agnishbrahma4858]

8:50 Yaha hum "Normal WHILE LOOP" kyun nhi use krr sakte?? Asal mein normal WHILE LOOP use krne se output nhi aa raha!!!

[@CS_prathamghatkar]

8:05 we do that without do while loop ---- in while loop (ptr->next!=head) is it ok *harry bhai* 😅😅😅😅😅😅😅😅😅

[@AbdulRahman-tj3wc]

In that case last element will not be printed. You have to do something like this. void linkedListTraversal(struct Node *head){ struct Node *ptr = head; while(ptr->next != head){ printf("Element is %d ", ptr->data); ptr = ptr->next; } printf("Element is %d ", ptr->data); }

[@siddharthasarmah9266]

Very helpful thanks 😍😍🔥 🔥

[@vishalkhatal44]

@codewithharry What will be the time complexity of inserting at the beginning in circular LL? Is it O(n)?

[@yogeshchoudhary6828]

very good

[@someshmadan7633]

Please make a full tutorial of python 3.8.5

[@jayasridey1832]

Harry ek bat bolo, agar insertion at the first ke bad last mein head=ptr na kare toh kya hoga?. Kyunki circular h. Toh kaunsa head h kya faraq parta h?

[@KunalKumar-qy7uf]

Good morning harry bhaiya, for those who read comments insertion at the end of the list can be done in O(1) all you need to do is create a tail pointer which always points to the last node and whenever you want to insert just add that node in tail's next and shift that pointer to the next pseudo code for this can be : node = (create node with desired value) tail->next = node; tail = tail->next;

[@harshitachaurasia1246]

thanku sir

[@amanjha9429]

Abhi apka he video dekh rha tha html ka or notification aa gya 😀..

[@saouli1632]

Yes ..please make separate video for practice..this is best video for beginners to understand..The theory is so clear ❤..Tha 16:29 thanks bhiya..And Happy Teacher's day🎉❤ 09052023

[@ameenaamir5477]

hi harry bro what boilerPlate extension you use for c and c++ in vs code? pls reply me

[@jdujdjruxjJeujdj]

Love it