I had "implement circular linked list" in a TDA I've done previously with normal list as a college assignment. It looked simple so I tried doing it on my own, but it turned out it was NOT simple, as I encountered many problems along the way. Eventually I run out of ideas and I realised "I think I'm missing something here..." so I looked up some TH-cam vids about the topic to help, and first thing I found were yours. Gotta admit that even though I'm yet to try this, I have no doubt that now I really understand these kinds of lists. Turns out, I was trying to adapt my simply linked list library (functions and structure) to a circular one, but I didn't fully get the differences when traversing them, or when adding/removing nodes. But now I do, so thank you! Also, you're an awesome explainer Neso, each time I watch a video of yours, every topic gets 1000 times simpler to understand. The only thing I'd like is that you'd explain what would happen in special cases, like for example, in your videos about inserting nodes in these kinds of lists, I ended watching those and still wondered "but how do you do if there's only one node in the list? what if the list is empty?". I managed to figure some of those doubts out eventually, but I think if you could explain these kinds of situations, it'd be perfect. TYSM for the videos! They were of great value!
can we do like this instead of do while loop. struct node *p=tail->next; while(p->next!=tail->next){ printf("%d",p->data); p=p->next; }printf("%d",p->data);
p!=tail. For this condition it not print the data of last node it simply exit out of the loop So after exiting from the loop we have to write Printf ("%d",p->data);
![[LIVE] : ONE ลุมพินี 89 | คู่เอก "ยอดไอคิว vs คิริลล์"](http://i.ytimg.com/vi/Z3vYkHJ_5Ig/mqdefault.jpg)
I had "implement circular linked list" in a TDA I've done previously with normal list as a college assignment. It looked simple so I tried doing it on my own, but it turned out it was NOT simple, as I encountered many problems along the way.
Eventually I run out of ideas and I realised "I think I'm missing something here..." so I looked up some TH-cam vids about the topic to help, and first thing I found were yours. Gotta admit that even though I'm yet to try this, I have no doubt that now I really understand these kinds of lists.
Turns out, I was trying to adapt my simply linked list library (functions and structure) to a circular one, but I didn't fully get the differences when traversing them, or when adding/removing nodes. But now I do, so thank you! Also, you're an awesome explainer Neso, each time I watch a video of yours, every topic gets 1000 times simpler to understand.
The only thing I'd like is that you'd explain what would happen in special cases, like for example, in your videos about inserting nodes in these kinds of lists, I ended watching those and still wondered "but how do you do if there's only one node in the list? what if the list is empty?". I managed to figure some of those doubts out eventually, but I think if you could explain these kinds of situations, it'd be perfect.
TYSM for the videos! They were of great value!
Please post daily one video.... Your the best teaching of data structures... Super sir
Sir Ji..!!!! please make videos on stack , queue , etc ASAP :) and also thank you so much for this series. God bless you!
stack and qeeue are entirely based on linked list . binary tree would have be better
I love Neso Academy :)
Such amazing lectures with high quality 👍
Please , Make complete tutorial on playlist apptitude and resoning .
how much [deadline /time], you set for yourself to complete full gate cs lectures or it is a slow,gradual and random process?
thanks a ton for solving my doubt of while and do while 😄😄
you are great men you are great🥰
What about double pointers? Function will output error
Please increase the frequency 🙏🙏
instead of using do while loop we could have used "continue" , am i right?
can we do like this instead of do while loop.
struct node *p=tail->next;
while(p->next!=tail->next){
printf("%d",p->data);
p=p->next;
}printf("%d",p->data);
if we will do like this, then we can not able to print the last data of the list
sir please assure me is your content enough for gate cse preparation ?are these lectures mainly specifically desgined for gate cse ?
u can get harvard bro
btw lol was it enough?
Sir pls tell me what happens to p after this statement
For(p=head;p!=null;p=p->next)
free(p);
P is made by SMA so after finishing function p will destroy automatically
Hahaha i know i found msg too early 😁
What if we used p!=tail and used only while loop?
p!=tail. For this condition it not print the data of last node it simply exit out of the loop
So after exiting from the loop we have to write
Printf ("%d",p->data);
Nice
up
😃
👍👍🌟🌟🌟🌟🌟