Sir awesome content! Good work Sir, you are proving all your haters wrong by bringing such awesome content. Kudos and hope you complete it soon! May God bless you abundantly!!
Funny when i made the code it felt very difficult, now when you explained this, it doesn't sound so difficult. Will have to tryout this code for different cases. Thanks a lot
The one thing that is amazing in your lectures sir, that you explain the logic of every piece of code: How that works and all...I salute you for that Sir 🙏
Sir please please make complete playlist of linked list. You are the only one who made me to understand data structure Please sir make complete playlist of linked list.
Thanks for another great video. I was asking if there’s a way to get (buy) file handling videos of C programming if I don’t have an android device? I am working on both C and data structures.
Hey neso academy Please bring the html css and java script course please there are lot of videos on youtube platform but your chnanel explanation is very nice so please bring it up
Super sir.shall you explain with a c++ program which includes single linked list as headerfile.using that headerfile, can we do all the operations of linked list?If it is possible then please explain it sir.Is there any predefined single linked list ADT available in c++.If it is available then please explain it with simple c++ program.Thanking you sir.
Why dont we first traverse the list in a function and then put address of last node in temp and then second last in temp 2 then put addresses in a reverse order
why can't we use group theory permutational group concept ,like as we see in first example we have a permutational group of order 3 thus let our initial link list be r then r^3 is e which is r itself but it's inverse is r^2 as r*r^2 is e thus by two or just one pointer we can solve this problem...
Really good one I have tried to make something deferent by kinda swapping all the linked list one by one its kind of taking the head and put it on the tail and something....
Sir please explain this:- We're using "struct node *_____; " so this means ___ will contain data & link too. So whenever we're creating any new pointer why don't we use int. Because if we're using struct node * then everytime it'll create a new node due to struct node data type. Please explain anyone can do so please.
It's not like whenver you write struct node *, it'll also occupy memory of (int + struct node *). by writing only struct node * ptr, it'll create a pointer that can only store the address of Node type data. But if you use struct node *ptr = (struct node *)malloc(sizeof(struct node ) ), then only it'll actually request memeory from heap via malloc function by creating the memory instance of that node data-type.
Golden channel for CS students...
As I am a CS student Neso Academy is my real university that I can depend upon.
Exactly.
Go to class to see what teacher is teaching
At home do exercises
Whenever with any doubt or difficulties in a topic watch Neso Academy
Repeat
"Thank you sir！" --from a CS student in China
but in China, RUclips is banned, right ?
@@dibyajyoti_47 vpn
Lier
@@parthmalhotra4133 yes bro
Me too CS student from China.I’m here too bro 😂 our real university is RUclips.
Before watching this, had seen around 3-4 videos related to same question. But this gave me a very clear idea. Thank You.. My Best Wishes for you..:)
watching it from USA. i never had a teacher who explain so good!! kudos to him
Man what do you do by the way?
this is most simplest and easily explanation of this question imo. Thanks a lot!
you are the best teacher ever and this playlist is so underatted
Great Explainer and great voice 🔊🔊🔊
loving the class
had to comnt to boost your content.
you're a doc, you reduced my headache by explaining it in such a way. great job please keep posting more and more videos
Sir please increase the frequency of videos.. Most of us are tptally dependent on you.great fan. Please drop your insta id....
you do understand it takes time, effort and cost to make such high quality course.
You made it Easy !! Thanks man for such a quality content !
Best explaination with minimum steps!!!!! Thank you🙏👍✌
And one more thing I completed all operations in Linked list and now I am able to do that confidence Thank you!!!!!😃😄😁
This is by far the best explanation I have found on the internet.
Thanks best explanation
Sir awesome content! Good work Sir, you are proving all your haters wrong by bringing such awesome content. Kudos and hope you complete it soon! May God bless you abundantly!!
Funny when i made the code it felt very difficult, now when you explained this, it doesn't sound so difficult. Will have to tryout this code for different cases. Thanks a lot
The one thing that is amazing in your lectures sir, that you explain the logic of every piece of code: How that works and all...I salute you for that Sir 🙏
Sir please please make complete playlist of linked list.
You are the only one who made me to understand data structure
Please sir make complete playlist of linked list.
Okay! I need some cofee, now. WOW! So much to digest and brilliantly explained.
I am a huge fan of is voice and teaching
Sir Continued seriously super excited about further vidioes. Your teaching nailed the data structures
Sir is it possible to complete the data structures series before gate 2021?
Kudos. Excellent teaching ..
What an explanation. Just amazing !!!
Very helpful 💚
Best explanation ever!
yaar ye @nesoacademy kitna awesome hai yaar
Excellent explanation. But I would suggest to slow down the algorithm part a little bit
I have fallen in love with this guy and the subject❤❤❤
I love Neso Academy. 💝
I didnt get a thing, but I really enjoyed it😂. Very well presented with good illutrations
superb explanation
Great explained thankyou sir😍☺️☺️
Thanking you whole heartedly 🎉
I am waiting for recursive approach.
thank you that was really helpful
sir, I think before returning head pointer to main function, there should be one more statement i.e. prev=next, so as to release prev pointer.
Sir you didn't declared ptr in the program. When I try to run in compiler it doesn't work. how can I declare ptr ?
Thank you very much! I think you've just saved me
the best I could find. Thanks for making it easy :)
Thanks for another great video.
I was asking if there’s a way to get (buy) file handling videos of C programming if I don’t have an android device? I am working on both C and data structures.
This is really helpful
Thank you so much sir 👌
Nice It's too easy to understand
Sir please upload complete data structure
Love from Nepal
Hey neso academy
Please bring the html css and java script course please there are lot of videos on youtube platform but your chnanel explanation is very nice so please bring it up
This videos just cleared my doubt
very efficent video ty
Big fan of Neso Academy
Thank You
Sir please upload more videos on Data Structures 🙏
thank you so much
7:47 excellent
in the following peice of code at "11:37" code where we are setting first node link to null?, or my understanding is worng?
Could youbplease explain DSA in python program
11:09 instead of [head = prev; return head;] we can just do [return prev;]
Sir,i found very difficult to get this logic by myself , how to build such logic mind?
"Thank you sir!" °-° -from a CS student in Odisha
Temp (last node)
Temp2 (2nd last node)
temp->link=temp2
temp2=*temp
Thanks mate.
Sir reversing the linked list means i first thought that just reversing the data in the nodes,
Is doesn't mean sir?
But output is same for both.
Good One 🔥
Listen once again carefully if you didnt get it in your first attempt bcz it is very simple if you concentrate.
Thank you from algeria
Sir .... Does the code remains same if we use concept of double pointers ????
Super sir.shall you explain with a c++ program which includes single linked list as headerfile.using that headerfile, can we do all the operations of linked list?If it is possible then please explain it sir.Is there any predefined single linked list ADT available in c++.If it is available then please explain it with simple c++ program.Thanking you sir.
checkout @mycodeschool . He has taught DS in c++
Sir please explain it in RESURSIVE APPRAOCH
why cant we reverse the data instead of reversing the node i think both make the same sense
🙌
If i try to seek input from the user , (inserting element at the end) displays 0 and then the value. why am i getting a zero when i print it?
can we pass head by address here?
Sir it's very good but It is discontinue,
Yesterdays class was about the apptitude & reasoning
Why dont we first traverse the list in a function and then put address of last node in temp and then second last in temp 2 then put addresses in a reverse order
WOW 🔥
awesome
sir i am still confuse in ptr function mentioned inside main() which vedio i can find it ?
actually ptr loop
why can't we use group theory permutational group concept ,like as we see in first example we have a permutational group of order 3 thus let our initial link list be r then r^3 is e which is r itself but it's inverse is r^2 as r*r^2 is e thus by two or just one pointer we can solve this problem...
auch ! it's not a circular link list 😅😅
This guy is an amazing teacher but his accent is so funny
i mean it's his native accent like every country have
Can u plz reverse the linklist using array plz...
what is the use
Only one word "best"
add subtitles please
Really good one
I have tried to make something deferent by kinda swapping all the linked list one by one its kind of taking the head and put it on the tail and something....
But what if we have 100 nodes
why do they say linked list reversal is hard
Sir please explain this:-
We're using "struct node *_____; " so this means ___ will contain data & link too. So whenever we're creating any new pointer why don't we use int. Because if we're using struct node * then everytime it'll create a new node due to struct node data type.
Please explain anyone can do so please.
Yes u r right
It's not like whenver you write struct node *, it'll also occupy memory of (int + struct node *). by writing only struct node * ptr, it'll create a pointer that can only store the address of Node type data.
But if you use struct node *ptr = (struct node *)malloc(sizeof(struct node ) ), then only it'll actually request memeory from heap via malloc function by creating the memory instance of that node data-type.
you could have used better variable names to make it more intutitive, but still good job
Neso Academy X
Neso University XD
Legend
Plz upload nxt videos
You yourself understand... :)
In my college they are still teaching how to use variable and here I am reversing a single linked list.
Please complete sir
.i beg you
please subtitle arabic (translate arabic)i need it necessary pls
😯😯😯🧐🧐🧐🧐👏👏👏👏
yoyo
i really appreciate your effort but you keep explaining same concepts so long and it makes me bored and i lose the your flow,just a review
GFG explained better this concept
too fast