C++ Program to Implement Circular Linked List Data Structure (Full Code) | Part - 2 | DSA

[@SimpleSnippets]

Hey Guys, if you want more such tech educational videos on this channel then please support me by subscribing to this channel & also share it with your friends as it helps me create more content just for you ✌

[@konstantinosdrakakis5263]

at lines from 195 to 215 you don't need to do this , with this way , because uou have the function tha checks if the node with a paticular key exists

[@abrarahmad9687]

I use the code of simply link list and alter it for the functioning of a circular one, is it okay, I feel more comfortable with it?

[@komaldeepsingh6356]

There is a little error in this code. If there is only one node in the Whole list, then on deleting it, it still dont get unlinked . The mistake is in the line 178 at timestamp of 25:38 where we should write if(head -> next = head) instead of (head -> next = NULL) because it is a circular linked list. I am watching this video 3rd time for revision, and noticed it now. I know its just a little mistake which is normal and can be made by anyone but dont know why I am feeling very good after finding it out😂😂. Now I feel that I have understood the code nicely. BTW, I love ur videos bhaiya💖💖💖💖💖💖

[@ishanrai3951]

i was just going to comment about this mistake lol xd

[@kushal6065]

@@ishanrai3951 but in cicrular linked list there is no NULL. then why he used NULL?

[@ishan10s]

@@kushal6065 replace it with head he must have done it by mistake

[@kartikpaliwal9654]

@@kushal6065 using null is a mistake

[@СарварбекКабулов-к9я]

but he mentioned that instead of NULL there should be HEAD

[@ryanphung3858]

just subscribed. These linked list videos have been super helpful! I really enjoyed the drawings, it made the concepts so much easier to understand! Thanks for putting the time to make these vids :D

[@kushal6065]

At 28:24 you made too much complicated for my small brain, so i found my own easy way. Instead of doing writing all that else part after line no. 195, We can simply write this less code and works perfectly: else { Node* p = head; while(p->next!=ptr) // we know that "ptr" has the address of that node we want to delete { p = p->next; } p->next = ptr->next; free(ptr); cout

[@desrucca]

I just have sucessfully made doubly-circular linked list, thanks to ur vids.

[@vivekmunna]

You are awesome teacher. Just completed all 16 videos.

[@ThatLLMGuy]

Hey bro. Remember me? I was waiting quietly without appreciating to see that how long you continue this series. (I watched all the vids...)... And I saw that you are quite dedicated to this work.... Just keep it up bro... You are awesome

[@SimpleSnippets]

Hi buddy yes ofcourse I remember you 😇 And thank you so much bro for the positive feedback. Means a lot to me especially because these DS videos take a lot of time and effort. You can see from the video length also that these videos are very lengthy but they are very detailed too so takes a lot of efforts in post editing work too ✌

[@ThatLLMGuy]

@@SimpleSnippets yes I know... And I was waiting for how long you can continue. Please continue this.... :D...

[@mdaslamali9269]

Happy teachers day sir!! From u i have learn't the data structure.

[@SimpleSnippets]

Thank you very much Ali. Glad to know my videos have helped you ✌

[@ChandrapalSd]

Please cover the topic of non linear data structures.

[@amirtv345]

Thank you so much, Love from Pakistan, Bro you have helped me a lot, I'm a final year student of computer science, But I couldn't understand these concepts from my university, I am following your data structure course and working until i get full comfortable with the data structure, God bless you. Tanmay Sir

[@abdullahmaqsoodhere]

Which university are you from?

[@dejan9851]

Hey bro this videos is awesome you are best teacher. Are you working somewhere when you learned C++ and other things how long have you been programming I am interested in what the salary is and what is enough for the job.

[@jamesnash9675]

you r the best..............masum

[@pranavpatki]

20:04 why do we need 2 conditions ?? Why do we need to specifically mention if ptr is head or not ? The node can be inserted without that also right ?? Pls correct me if i am wrong.

[@brahmkaransingh8804]

Yes you're right . I have also come in comments to mention this and found yours

[@bozhou1454]

line #147 to #158, can we combine them? since we do not need to consider if(ptr.next==head). #149 and #155 actually are the same, as when ptr.next==head, ptr.next==head. so, we can cancel the if/else and only retain line#155 to #157

[@dhanarajjangi2926]

Hey bro... in checknodeexist it is possible to set ptr as head next and then apply while loop.....

[@hadiar1573]

Great Video! Just a question tho. in the DeleteNode method, shouldnt the condition for the currentpointer in the while loop be while(currentpointer->next != head) ? please explain this, im very confused. because Currentpointer is never going to bull since its a circular Linked list??

[@sakshisinghal1669]

in the insertNodeAfter() when the condition comes to insert a node then I am not getting why two conditions are taken for it because when you have checked if(ptr->next == head) then you are assigning head only in the newNode->next which is same as assigning newNode->next = ptr->next and that is exactly the same as in the else part. kindly check please

[@sharmeenkhanam2924]

Hey Tanmay can please upload further videos of this series ASAP. Because I have to sit in many interviews and without your tutorial I can't clear the technical round

[@SimpleSnippets]

Hello sharmeen, well I'm trying to make videos as fast as possible. As you must've seen, these videos are pretty lengthy and take up too much time and effort compared to other subjects cause DS videos need theory + practical explanation and on top of that I also have to try and demonstrate the working visually which adds more efforts 😅 Having said that, surely I'll try to upload as fast as I can but in the mean time try to checkout other resources too like geeksforgeeks etc. All the best for your interviews 😊 Do follow my Instagram handle too - instagram.com/simplesnippets

[@sharmeenkhanam2924]

@@SimpleSnippets Thank you for your quick response. Do you have any future planning of making videos on Machine learning?

[@SimpleSnippets]

Well I am not well versed in ML especially the practical side of it. However, I would definitely collaborate with some expert in future for some ML videos. 😇 Or maybe myself learn a few things and share it with everyone ✌

[@sharmeenkhanam2924]

@@SimpleSnippets You're doing such a noble job👏👏🙌 God bless you!

[@SimpleSnippets]

Thank you so much Sharmeen, happy to help 😇 I would request you to please share the videos and our channel with your friends too so that we can reach out to more users and students who will benefit from these tutorials ✌😇

[@ramadanaliyii4284]

good i am appreciate you

[@algorithmo134]

@Simple Snippets For deleteing a node with key value k; the code should be like this; In the else part see below *** It should be like this. if (ptr == head){ if (head -> next == head) ..... } INSTEAD OF if (ptr == head){ if (head -> next == NULL) ..... } Correct code: void deleteNodeByKey(int k) { Node *ptr = nodeExists(k); if (ptr == NULL) { cout next = head -> next; head = head -> next; cout next; currentptr = currentptr -> next; } } prevptr -> next = temp -> next; cout

[@arnabpratihar3]

How constructer node(int k ,int d)is called?? There is no such object node n1(4,5);how dynamic allocation in this part worked ??thanks for amazing tutorial

[@jayuchawla1892]

// Some code reuse void prependNode(Node *n) { // the only difference between prepend and append is: prepend requires head to be pointed to latest inserted node appendNode(n); head = n; }

[@abhishekhm.s6945]

spr bruh..i only realized after seeing ur comment

[@sriramnagarajanit]

Hi Simple Snippets, Could you please make all the courses as a fully length video. That would much useful to continously watch.

[@SimpleSnippets]

I might do that in future after completing the full course. But I am not keen on doing that. Nobody watches the full length video completely. Mostly users prefer topic by topic full playlist so you can choose what you want to watch ✌

[@sriramnagarajanit]

@@SimpleSnippets Yes i agree upon you. Jus set one full length course for c++ once you have completed. Thanks✌🏻

[@teetanrobotics5363]

@@SimpleSnippetsJust keep it as it is.It's perfect

[@jayeshyedge7171]

Hey bro thanks for this video!!!!!!

[@SimpleSnippets]

Most welcome Jaysesh. Thanks for your comment. Please do share the video with your friends too 😇

[@rishabhtatia3444]

In delete node after inserting one node it will not delete.It should be head->next == head.Line 178

[@anushkayadav6413]

Same doubt

[@gamsterilyass2952]

❤❤

[@IamImranMalik]

Sir, your delete function is not working correctly

[@ChandrapalSd]

Please increase the frequency of uploading videos.

[@SimpleSnippets]

Its not really possible to increase the frequency as these topics take up a lot of time and effort in prepping up the content and working on the teaching style. Infact many times I have to take more than 1 take because I am not satisfied with my own teaching so complete 1-2 hrs of video recording gets wasted. Hope you understand. However, since I am only focussing on DSA right now, videos in this playlist will keep coming up without any other interruption 😇✌

[@ChandrapalSd]

@@SimpleSnippets Ok brother. And keep providing us this high quality content 😘🤗

[@expert77]

[@paritoshkashyap5219]

Thanks, Tanmay for guiding us Maine circular linked list ka pura code smjha or mujhe smjh bhi aya But jb mae usse online c++ compiler pr use kr raha hu toh vo error dikha raha hai I have learned the code of circular linked list but when I am applying it on online c++ compiler, there are some errors In fact I have copied and paste your provided code of circular linked list in the link and try it once to run but There are errors I m using this 👇 www.onlinegdb.com/online_c++_compiler Plzz if anyone can help me out and tell me where is the problem, Thank you

[@kushal6065]

I thought that there was no NULL in circular linked list.....

[@hobbycoding7056]

You suggested to see the previous video.. but didn't give the link of that video in the discussion... please don't do that. This thing will reduce ur views

[@vivekmunna]

You are awesome teacher. Just completed all 16 videos.

[@SimpleSnippets]

That's great to know buddy, please do share our channel and videos with your friends too, that's the biggest help and support you can provide buddy ✌

[@gamsterilyass2952]

❤❤❤