u r only person , who has uploaded videos on how to create a doubly linked list , otherwise every one is uploading, insertion and deletion......,. aswesome videos sir, keep it up-.......
Sir your explanation is too good👌👌👌,finally I can visualize the nodes and understand the operations on them..thanks a lot sir keep making more videos on DS..🙏🙏thank you
Sir I have been watching your video since 2020 .i learnt lot of knowledge by your videos. Your explanation is extraordinary sir.no one can take your place your way of teaching is very best . I am proud to be say you are my best teacher thanks for wonderful teaching my best wishes to you and you will always teach us ❤️❤️🥰🥰 thank you sir ☺️ yours obediently student sivaraman
I am watching ur video s daily sir.if our lecture s explained well in class we will not come to see u tube . But i got very good lecture videos from u sir i am sincerely thanking u for explaing in very easy manner I understand the topics clearly..... Lot s of love sir if we got the lectures like u in our college we are blessed..... ☺☺. . . Reply me sir
Hi thanks for your support towards our channel and I have already uploaded SINGLE LINKED LIST AND CIRCULAR LINKED LIST. Please go through the DATA STRUCTURES playlist in our channel.
Thank u sir..🙏🙌aap bhut achhese explaination krte h, bt aapse ek request h sir k, sbko english nhi aati so aap hindi me bhi aise v.bna skte hai kya sir plz..taki hm sbko ar jyada thikse smaj aaye..plz sir..🙏🙏🙌
Haha Its not about Fan if i switch on the Fan there will be lot of disturbance so i will switch off fan while recording session. Any way thanks for your concern
Sir in all linked list types using malloc function we can create only blocks of memory of struct node specified to it. But sir malloc cannot create struct node pointer variables like new it can only assign address of block created by it to new. So sir I have only this problem that new is created earlier. But new is not the node of linked list it is holding only address of the node . Am I wrong sir?
How to take tail sir plz explain i understood everything thing bt ...tail not understand means it is not created, not assigned...how to take directly tail...
hi sir sir instead of.................. struct node{ struct node *prev; int data; struct node *next; } can we write struct node{ int data; struct node *prev , *next; }
u r only person , who has uploaded videos on how to create a doubly linked list , otherwise every one is uploading, insertion and deletion......,. aswesome videos sir, keep it up-.......
Sir your explanation is too good👌👌👌,finally I can visualize the nodes and understand the operations on them..thanks a lot sir keep making more videos on DS..🙏🙏thank you
Sir I have been watching your video since 2020 .i learnt lot of knowledge by your videos. Your explanation is extraordinary sir.no one can take your place your way of teaching is very best . I am proud to be say you are my best teacher thanks for wonderful teaching my best wishes to you and you will always teach us ❤️❤️🥰🥰 thank you sir ☺️ yours obediently student sivaraman
I'm watching your lecture daily 😊
Thank you very much Sir 😍😍
I have seen so many videos even though ididn't got clear idea .Then now your video saved my time 🙏
this video saved my life thank you sir
Thanks for such wonderful videos,high quality tutorial.
U r explanation is very good we can easily understand the conpcepts thank u so much 🙏🙏
sir your explanation is too good!!! Thank you so much
This video is very helpful 😊👌
I am watching ur video s daily sir.if our lecture s explained well in class we will not come to see u tube . But i got very good lecture videos from u sir i am sincerely thanking u for explaing in very easy manner I understand the topics clearly..... Lot s of love sir if we got the lectures like u in our college we are blessed..... ☺☺. . . Reply me sir
Hi Karthik very happy to see your msg and thanks for your support towards our channel
thank you sir we proud to explain the double link list but we requested single linked list and circular on lap thank you sir
Hi thanks for your support towards our channel and I have already uploaded SINGLE LINKED LIST AND CIRCULAR LINKED LIST. Please go through the DATA STRUCTURES playlist in our channel.
Sir your class is very helpful please take a session on big o notation and time complexity
You are great sir...
Appreciate sir for your hard work .
Superb explaination
Superb explanation
Sir you are too good....
Awesome sir
Thank u sir..🙏🙌aap bhut achhese explaination krte h, bt aapse ek request h sir k, sbko english nhi aati so aap hindi me bhi aise v.bna skte hai kya sir plz..taki hm sbko ar jyada thikse smaj aaye..plz sir..🙏🙏🙌
Sir can we swap the statements of connecting the link ? To my perception there should not be any problem 🙂
Sir good, but write a full code for creation of d link sir only once plz
UA-cam nunchi vacha money tho oka fan konukondi sir😇
Haha
Its not about Fan if i switch on the Fan there will be lot of disturbance so i will switch off fan while recording session. Any way thanks for your concern
Sir once can you implement the entire program
🙏🙏🙏🙏
Sir please do explain the program of this topic it would be a huge favor on all the Cse student's Thankyou.
👌👍
Sir in all linked list types using malloc function we can create only blocks of memory of struct node specified to it. But sir malloc cannot create struct node pointer variables like new it can only assign address of block created by it to new. So sir I have only this problem that new is created earlier. But new is not the node of linked list it is holding only address of the node . Am I wrong sir?
How to take tail sir plz explain i understood everything thing bt ...tail not understand means it is not created, not assigned...how to take directly tail...
Thank you so much ❤️
Hi sir we can't see the content what u r writing on the board the distrubence of the caption letters
What's the difference between head pointer and start ?
Both are same.... Difference is name ....
we can use circular linked list in Double linked list
Thank you Sir
Sir where I have keep logic in the program
If you reply I fell so happy sir
Sir, Please make a video for circular single, cirular double and all other data structure implementation using python.
Sir to getvn nodes we have to use n=5 and while (i=0
what will be stored in head->next since we are using tail for iteration, we have already stored new in head then head->next==NULL
Sir please explain how to write a program for this so we can practice for all other linked lists
Thq sir for that
Sir why we are using the pointer temp here?
hi
here we should not change the position of head so instead of doing that we are taking the temp variable.
Thank you sir
❤❤❤❤❤
How many tyms iwas focused also 😢
sir please reply me how these head and tail are null by default
Hi
We are initializing them to. Null at the starting later we are keep on updating them.
Sir once give full code please provide in description
Sir how can I contact with you?
hi sir
sir instead of..................
struct node{
struct node *prev;
int data;
struct node *next;
}
can we write
struct node{
int data;
struct node *prev , *next;
}
Yes we can 👍
Basic kre nhi pehle?😒
Sir plzz we want entire program sir plzz 😢
thanx sir
What is the meaning Of Default and By Default
void reverse()
Sir not understanding 😢
You are the reason for unfollowing jenny lectures