The most important thing that makes people love your class is, you dont give a gap for writing stuff. I meant u r not silent for more than 1 second, keeping everyone hearing you engaged for entire entire time.. Most lectures keep silent whn they write stuffs and tht distracts people hearing them. Great stuff even from physiological point of view.
I was offend because couldn't get good video tutorial in free...but finally I got your video..it was better late than never.....I was worried to learn computer languages..because I had no any idea of this field
Temp -> next = head; It will come after printf(" press 1 to continue ....) Scanf ...... Because last node should contain address of first node only after user do not to insert a new node ie. User has already entered his last list block.
madam I have a question that you have written (temp -> next = head) after else condition to connect last node to first node inside the while loop but what I think that it should be outside the loop because at last we have to connect last node to first node not after every input of new node. please response to my query madam.
13:41 you made the new node's next part which is temp-> next= head in that line you are writing.. so previously , five lines before that line you wrote new node's next part = null. Is that line unnecessary?? After writing the current line at this time stamp
No , for again implementing while loop we have asked user to enter his choice . If he enter 1 then 1 means true , so while loop will again run and if user enter 0 ie. False , so loop exits.
Mam head=0 should be written outside the function as every yime when we call the function all of the data stored in it is gonna delete. Otherwise everything is correct. Thanks for lectures mam.
Mam insertion or deletion koi v operation kare k bad agar first create list ko call korte haa to puro program exit ho raha haa ab use kayse thik karenge
one more solution for displaying circular list head = temp->next; printf("%d",head->data); while(temp != head) { printf("%d",temp->data); temp=temp->next; }
Hey Jenny.. Big fan of your method of teaching But in this video at 14:37.. You have committed a small error. newnode->next=head; Since the beginning.. I know it's silly, and you missed it by mistake.
instead of doing all the temp->next at 21:10 we can directly do that: while(temp!=head){ printf("%d ",temp->data); temp=temp->next; } there would be no need of writing again the printf temp ka data. Thank YOU.
One improvement we can do in the display function is to use do...while loop... Assign temp = head, print data of head and then temp->next, wit condition of temp != Head As we know do while checks after execution, we won't need to write additional line to print temp->data
To display it will be better to use do-while loop. void display(struct node *ptr) { struct node *temp = ptr; printf("Your linked list is:- "); int i=0; do { printf("%d ",ptr->data); ptr=ptr->next; i++; } while (ptr!=temp);
I have just started the data structure. I'm having trouble to understand it. Can you give me some tips that I can understand the data structure better and very effectively...😒😏
Maam I think after this while loop we should write temp -> next=head.....otherwise in each time of insertion of a node ,the last circular link will be created....maybe when choice 0 then we should do that circular link......is my thinking right maam?
The most important thing that makes people love your class is, you dont give a gap for writing stuff. I meant u r not silent for more than 1 second, keeping everyone hearing you engaged for entire entire time.. Most lectures keep silent whn they write stuffs and tht distracts people hearing them. Great stuff even from physiological point of view.
I was offend because couldn't get good video tutorial in free...but finally I got your video..it was better late than never.....I was worried to learn computer languages..because I had no any idea of this field
Now what are you doing ??
@@mayank_2199 what about you senior???
@@saurabhkumar0728 nothing junior just studying not that properly but ya trying..
Please don’t be offended 😢
Ma'am is saying this is not only the way to do the code
But we are addicted to it 😎😎🔥
Eassssyyy- pisssyyyyy
Lemon squizzy
Hi Jenny mam
Thanks for providing such awesome videos 🎥 free
So everyone can access it 💯🥰
One of the best teacher on TH-cam for data structure
Thank you apa....i have done well in CSE207 by following your video...keep creating good videos ☺️
What is CSE207??
Temp -> next = head;
It will come after
printf(" press 1 to continue ....)
Scanf ......
Because last node should contain address of first node only after user do not to insert a new node
ie. User has already entered his last list block.
simply write condition while(temp!=head)
Correct. Please upvote this answer for future students.
You mean out of while loop..if user don't want to insert another node..if am correct plz tell me..
@@kanak328 yes it should be written after while loop
sahi ha usme bhi chal jayega code
//Circular linked list
#include
#include
int main() {
struct node{
int data;
struct node *next;
};
struct node *head=NULL,*temp,*newnode;
int choice = 1;
while (choice){
newnode = (struct node*)malloc(sizeof(struct node));
printf("Enter data: ");
scanf("%d",&newnode->data);
if(head==0){
head=temp=newnode;
}
else{
temp->next=newnode;
temp=newnode;
}
temp->next=head;
printf("Do u want to continue press 1 otherwise 0: ");
scanf("%d",&choice);
}
printf("first node = %d",temp->next->data);//to check circular
printf("
Values of CLL: ");
temp=head;
do{
printf("%d\t",temp->data);
temp=temp->next;
}while(temp!=head);
return 0;
}
You're the best teach I ever seen
Ur videos really helped me in exams.....as revision I use ur video's
Awesome explanation mam......
First time I saw the good and excellent explanation........
Kya bat ha video de kya bat ha dso Ede ch kheri payi sogat ha😀
Awesome explaination
Your teaching is nice
Thank you so much ma'am
mam instead of using structure template can we declare a struct node *next like this? if not why? can you explain mam?
Wow ,no word u are just amazing
Very helpful video,thank you ma'am.
Awesome explanation 🌺👍
please make video on circular queue.
& thanks for sharing information & mam your vocals waooooOoooo attracts me.,
Explanation is very good
Mam u look gorgeous in this lacture..🔥❤️
Best teacher..
Excellent mam❤️❤️❤️
ma'am your teaching very good propare understanding the data structure so thanku so much ma'am
*Correction in display function
Instead of using while loop we will use do while loop and the condition would be while(temp! =head)!!!🤍✨
Explanation is excellent😍
madam I have a question that you have written (temp -> next = head) after else condition to connect last node to first node inside the while loop but what I think that it should be outside the loop because at last we have to connect last node to first node not after every input of new node.
please response to my query madam.
Please upload how to do insertion sort in circular linked list.
Thank you
13:41 you made the new node's next part which is temp-> next= head in that line you are writing.. so previously , five lines before that line you wrote new node's next part = null. Is that line unnecessary?? After writing the current line at this time stamp
love you mam apko dekhne mey he pure video khatm ho jathe
Nice explanation mam
I don't understand how that while the loop is gone work.??? To make while loop work it has to be increasing every time.
No , for again implementing while loop we have asked user to enter his choice . If he enter 1 then 1 means true , so while loop will again run and if user enter 0 ie. False , so loop exits.
increment has been done by writing temp=temp->next. The while loop will increment the value of temp until the value of temp becomes equal to head.
Amazing explaination!
Is ' temp -> next = head; ' in the right place?
Isn't it going to execute each time when the control comes out of the if else condition?
This is under the else condition
No it is not assigning temp = head it will again and again link the tail to head
Mam head=0 should be written outside the function as every yime when we call the function all of the data stored in it is gonna delete. Otherwise everything is correct. Thanks for lectures mam.
Bro mam to head=0 kahi likhi hi nhi hai mam ne compare kiya head==0 compare me value update nhi hoti So mam sab sahi likhi h
Very nice explanation really helped
Great job.. . Mam
Thanks for your videos ma'am
Wow mam u teach really good
we can also use do while loop
Thank you mam for this informative video !!
If u were my teacher in my clg . I would have failed again and again to come to ur class , because u are soo pretty..🥰
Don't waste ur time invest ur time that is what she tells if she sees this comment 🤣😂😂😅
madam please correct the code or give in the description we are not able to display the circular link list
Mam, display function me while(temp != head ) ko use kar skte h ?
method to display list
temp = head;
do {
cout data;
temp = temp->next;
} while (temp!=head);
Yup
amazing thank you
Thank you Ma'am...!
Mam Thank you so much!!!
Mam insertion or deletion koi v operation kare k bad agar first create list ko call korte haa to puro program exit ho raha haa ab use kayse thik karenge
Mam aap bahut intelligent hai
to display instead of using while we can use do while loop than the problem could be solved right
🔥🔥🔥
Mam can we use do while loop to print??
do {
printf("%d", temp->data);
temp =temp->next;
} while( temp!=head);
one more solution for displaying circular list
head = temp->next;
printf("%d",head->data);
while(temp != head)
{
printf("%d",temp->data);
temp=temp->next;
}
It's correct bro🤗🤗 in video maam statement is wrong
Bro, you can do the either way, as in both the cases you are left with one node to print.
can you give the complete code
Just put the head=Null in global declaration
But mam this temp variable is local variable it will be deleted after execution ??? I guess this will not work it will show segmentation fault error
Nice explanation madam...
hello mam, how temp pointer to move next to next node without looping?
Is it implenentation of circular linked list in c or is it implementation of circular linked list in data structures....please reply
Hey Jenny..
Big fan of your method of teaching
But in this video at 14:37..
You have committed a small error.
newnode->next=head;
Since the beginning..
I know it's silly, and you missed it by mistake.
Madam error occurred says that malloc should have a prototype....
Plse help me
Thank you so much..
instead of doing all the temp->next at 21:10 we can directly do that:
while(temp!=head){
printf("%d ",temp->data);
temp=temp->next;
}
there would be no need of writing again the printf temp ka data.
Thank YOU.
but temp=head initially. so (temp!=head) will get false instantly.
@@mobasshirajazjust use do while loop bro simple 🤍✨
Mam I think if we use the do while loop than while loop then it is better for us
Thanks mam 🥰
Welcome
Hello, can we free a circular singly linked list without maintaining two temporary pointers? If yes, kindly share the pseudo code.
no its not possible
One improvement we can do in the display function is to use do...while loop...
Assign temp = head, print data of head and then temp->next, wit condition of temp != Head
As we know do while checks after execution, we won't need to write additional line to print temp->data
right vro
yeah you are right I also tried with while loop alone it wasn't displaying anything but with do while it displayed the list
ma'am we can use this
while(temp != head) {
cout data next;
}
Ya you are right
No you can't do that.Because before while loop we initialize temp=head and according to your condition the loop will not execute since temp=head
Yes
Great visualization you have.
Great visualization you have.
Great !
Thanks mam
Mam in lab external xam can write the programme like this
Hi Jenny! please help me this questions Write C++ programming that display Circular linked list data 10 times without declaring additional pointer.
70% for watching mam
😁😁😁😁😁
why you dosen't use while loop in the else part of creation ??????????
*Mam make complete series on DBMS/MySql*
Will start DBMS as soon as I get time.
@@JennyslecturesCSIT after 50 days my next semester will start about DBMS. Hope you get free time before it. Thanks for your reply.
Hello,
Can anyone explain why there is a need of type casting malloc?
I think it is not necessary to type cast malloc.
To display it will be better to use do-while loop.
void display(struct node *ptr)
{
struct node *temp = ptr;
printf("Your linked list is:- ");
int i=0;
do
{
printf("%d ",ptr->data);
ptr=ptr->next;
i++;
} while (ptr!=temp);
printf("
The number of nodes is %d.
", i);
}
Mam mera error aaya hai .... undefined reference to 'winmain' bata raha hai or id returned 1 exit status bata raha hai
Mam plz ans me
hai jenny, how r u? you explanation is super. but one small suggestion to you, your videos are jumping. previous also i told same thing. thank you
No need to write struct node * before malloc when newnode * is already defined before
Mam NULL and 0 are different...
No, they are same..
Mam we can use current instead of
5:26
0.5x
👇here
Start java programming language course madam
I need it and even i want on data structures and algorithms in java
I hope you will make this
Nice video
But after executing the code it displays only 1 data and other nodes are not displaying 😶😶plzz help😢😢
Use chatgpt
you should run the program on the compiler
I love you maam
ily too
thanks
Mam can you do this program in Turbo c++??
do {
Printf("%d", temp.data);
Temp=temp.next;
} while(temp!=head);
A sahi hai ...but for c language temp->data likha jata hai..
You explanation is cute as you ❤❤
How to create an empty circular link list???
too good
Ma'am,plz make video on stack
Sure. Will start stack after linked list
@@JennyslecturesCSIT oohhh jenudiiii
you are from which university?
Mam plz upload a vdo on write a program in c to create insert delete and you are not in a circular linked list
Display function is not working properly
I have just started the data structure. I'm having trouble to understand it. Can you give me some tips that I can understand the data structure better and very effectively...😒😏
Try dry running algorithms
Maam I think after this while loop we should write temp -> next=head.....otherwise in each time of insertion of a node ,the last circular link will be created....maybe when choice 0 then we should do that circular link......is my thinking right maam?
I have understood maam after watching next video...That means each time of insertion of a node that last circular link will be created...