Funny how i have to pay 10K for data structure course at my University and still learn nothing but here i understood everything for FREE. Thank you so much sir.
Can someone tell me what will happen if lets say the 1st element in the linked list is at address 100 so the integer part will take 100-103 address and the node part will take 104-107 and lets say the next element in the linked list is from address 110. Now I want to insert a new element at the second position but there is no address available for that (as the new element + the node will take 8 bytes but only 3 bytes are remaining) Then what will happen?
Hi Mohan, Insertion at end will take O(n) because you will have to traverse the complete list to insert at end. Insertion at head will take O(1) ( constant time )
I'm currently taking a data structures class. I've listened to my professor. I've read books. I've watched youTube videos. This video is by far the clearest, easiest to understand, most well put together lecture on linkedLists I have seen. You are very talented at explaining things.
Hi Greg, Low level languages are machine language(instructions in binary) and assembly language. C is mostly called "mid-level language" because it gives a lot of low level control. But, generally the idea is that high level languages should give you a source code that should be portable to any architecture. Machine and assembly code work for a particular architecture only and need to be re-written if they need to be ported to other architecture.
@@raviprakash9215 Why did both of you go for IIT? You could have gone to Harvard or MIT or Caltech maybe you can get into Harvard 8 times but not IIT because JEE is the rest exam in the world.
@@aaryanpakhrani5671 Nice joke,by the you can't deny that professor of premier institution of India are not at all good at teaching they have only big certifications awards and degree that worth nothing if you come to attend class of that professor.
*My takeaways:* 1. Limitations of arrays 0:18 2. Linked list 7:43 3. Unlike an array, we can't access an element of a linked list in constant time O(1) 14:29 4. The time for accessing an element of a linked list is O(n), for inserting an element to a linked list is also O(n) 15:06 5. Benefits of linked list 16:29
My dream is to become a Software Engineer in the Bay Area, and as I sit through my first Data Structures and Algorithms course, and cringe at the explanations given by my professor and barely understand other concepts so far, this explanation of Linked Lists give me hope. Thank you so much for paying forward your knowledge, and presenting it in a way that I could understand it.
@@oscarwang7920 - Just keep learning, guys. You _will_ get there. Sometimes, a particular concept doesn't make proper sense until you understand other, related concepts, so you have to press on with a partial appreciation during the interim, but, your patience and dedication will pay off. Wizardry is very rewarding, in all kinds of interesting ways.
why the fuck am i paying so much to attend a college when i get free online tutorial from youtube? 15 weeks of college which is so compact and dense and i learn more from youtube since they cant teach
+mycodeschool plz help, I don't understand when he says that insertion of a node will take O(n), howwww...........??? i think just two replacements of Link values happened so it shoud be O(2), right??? so confusing... :( Introduction to linked list
muhammad waqas its not constant to say o(2) and there's no O(2) in Big O notation ... Also you don't know how many process you need to do (you don't know the linked list size ) So Its (n) processes ... I hope you got it :)
this is great i am glad that you make this course for free, this means so much to me. It's really sad i heard that you passed a way this is such a big lose you are such a talented man, Rest in Peace man
I cannot understand how anybody can disklike your videos. They are so well structured, considered and explained. Absolutely amazing. Dont give a .... on them who dislike your videos and keep up the good work.
Holy hell - I've looked through a lot of videos/courses and have yet to see an explanation of Data Structures that is this clear and intuitive. Seriously, thank you so much for this. The pictures and metaphors really makes concepts clear.
I usually dont like videos after I watch any video but this guy explained in such a way I could resist myself from liking it . I wish he may find peace wherever he is at
part 2... In Java, you can create a class class Node {int data; Node next; } and you will be good because classes in Java are automatically created on Heap (dynamic memory) and are referenced by variable name. To know more about stack and heap, see our series on pointers for a lesson on dynamic memory allocation.
Thanks Albert! Finally, someone just demystified the understanding of the Linkedlist. Important to understand Memory Bytes assignments to Nodes. Once you understand behind the scenes about the Memory Bytes Assignment for the Head Node and all the Nodes in the LinkedList, and then, the game is over, and you can be traverse the LinkedList as you want and delete any Node you want in the Linkedlist.
In C, structs are not created on heap or what we call dynamic memory. So, if you just create a Node normally , it will go on stack. Anything on stack is freed from memory once a function call finishes. You want to keep a node in memory till the time you want. So, you use malloc in C or new operator in C++. A node created using malloc has to be referenced through a pointer. That's why we have to use Node*. contd to part 2..
Dude you have no idea how much the scenarios helped. I wish my professor explained things like this instead of reading off of 90 powerpoint slides. I wrote it down in my notebook the same way you explained its really helped a lot.
Enrolled in cs50 didn't understand anything on lecture about data structure because the lecture kind of just sweeped through lots of data structures without in depth explanation, but just the basic concepts of each, so now im struggling to do the assignment, and I saw a vid recommending your channel and I'm not dissapointed so far.. Thank you so much for this vids helps a lot
This is one of the best tutorials you will ever find. The least we can do is disable the adblocker, since views with adblocker enabled don't get monetized.
The day after tomorrow is my exam and I don't even knew why linked list is so important. This is the best video on Linked list. Nicely explained. Thank you very very much sir. God bless you...
I study at one of the top CS universities in the world, but I still don't understand what my professor says. You explained WAY better than my university professor. Subscribed. Thanks a lot!
This actually helped me out quite a bit. Your videos have great quality and I appreciate the jump-cuts when you're drawing and the accurate subtitles. Thank you.
It's my first time to learn link lists during summer class which is only 6 weeks. I wish my professor began the class with an explanation or rather an illustration such as this one. After watching this I can clearly understand what link lists are all about. Thank you
Beautiful Explanation! I think this is the first time I have understood what linked lists are! Fluidic demonstration and wonderful manner of progressing on a topic.
I love this tutorial but have not watched it yet because of my hearing-impairment i cant hear what is being in this video :( So please get me their subtitles so i can use them to add it on it using VLC player. Thank.
mycodeschool Okay. I really meant that i want to download their subtitles in srt format for these video tutorials (already downloaded) for offline use. Please if u have them, let me get them through my email:- joe198930@gmail.com. I look forward to it. Stay blessed.
You cannot add a new element unless you create a new array of larger size. That's what we are saying.Vector is built on top of arrays. In vector implementation, when array gets filled, we recreate a new array of double the size of the previous array and copy the content from the previous array to the new array. We keep doubling the size of the array each time it gets filled. If we use dynamic memory allocation for arrays, we may sometimes be able to extend the same array using realloc function.
Your content is on a different level than other youtubers who are making similar study content. When I start seeing your video I get assured in the beginning that I will understand the concept. Thanks for giving that confidence to your viewers through that content. cheers
if someone doesn't understand this ,then its better that you leave IT field and become something else!!!!!!!!! This is the best ever explanation possible.
I was struggling to get understand and how to implement this linked-list ..but this cleared my many concepts....May Allah show straight path to u brother.....
Jimmy Watson I would quote a dialogue from the famous movie Matrix, " What's real NEO? If real is something that you can see and feel and touch, then they simply are electrical signals generated by your brain." Allah, God or anything you want to name it is a question. A question, "What's the source of our creation?".. And as the Buddhist say, till the time you do not know the answer, you should say "I do not know".. I call Allah or God a seeking, an attempt to answer some unknowns, a submission to some higher energy in which we all dissolve. Whether its real or not is a conclusion and I cannot draw it. I am certainly accepting Rahim's wishes. And I am accepting your reasoning too. :)
Explained brilliantly!Our college professors should teach like this.I was having a lot of troubles in understanding,feels like i am going on the right rack now.
Thank you for this explanation! I had some knowledge of how linked lists worked, but my knowledge was limited and convoluted. This video answered many of my questions. Thank you. Great video!
Very great , thank you sir Tommarow is my exam.. It helped me a lot because i understand the principle......,. Not like byhearting it....thank you.......sir
what a great video, all the doubts got cleared i.e why the address block is included int the node , ur way of teaching is awesome loving this . thanks for such a video
This guy has a talent in explaining things. He is probably a mathematician. Keep up the good job. P.S. ("Disjoint". I know what you're refering to :3 Weidmans Heil)
int* will store address of integer and not address of node. You need a pointer to node to store the address of node. Where exactly do you want to create an int* ??
Excellent brief on "introduction to linked list". Crystal clear explanation with nice story. Thank You very much !!!. And your voice is so nice to listen ...
Thank you so much for this video, you have managed to explain a concept that is hard for a beginner like me (May be easy for others) in such a beautiful and simple way! I wish you all the best for the future!
What a fantastic video. I love how much there is to learn online these days. I need to learn more about data structures to be a better programmer and I also want to be prepared for when I eventually start my Bachelors level classes in my Computer Science degree. I saw the use of a LinkedBlockingQueue in a game programming series I'm going through which led me to Stacks and Queues, and then Linked List, and next is Blocking Queues
Funny how i have to pay 10K for data structure course at my University and still learn nothing but here i understood everything for FREE. Thank you so much sir.
Amamzing videos.
same :/
RUclips or other Videos Series are the best mode of learning and one doesnt needs an University for it!
10k for one course? XD what uni is that?
@@ppsj69 Seriously XD
Your videos are beautifully explained, you have that gift, not everyone can explain with such clarity. Thanks for your help.
+Kyrinky exactly, i could not understand my professor, and the class was boring. This video is so attractive and clear.
cant agree more
yeah I am totally diggin it .
Can someone tell me what will happen if lets say the 1st element in the linked list is at address 100 so the integer part will take 100-103 address and the node part will take 104-107 and lets say the next element in the linked list is from address 110.
Now I want to insert a new element at the second position but there is no address available for that (as the new element + the node will take 8 bytes but only 3 bytes are remaining)
Then what will happen?
@@AdventuresofMayank it will not take the between addresses it will create node in another address and just attach it
Hi Mohan,
Insertion at end will take O(n) because you will have to traverse the complete list to insert at end. Insertion at head will take O(1) ( constant time )
O(n)
omega(1)
Thanks you
Thanks for the clarity!
not necessarily, it depends how you set things up. I'm able to insert and remove elements wherever in my linked list at O(1)
@@Derbb how?
I'm currently taking a data structures class. I've listened to my professor. I've read books. I've watched youTube videos. This video is by far the clearest, easiest to understand, most well put together lecture on linkedLists I have seen. You are very talented at explaining things.
Hi Greg,
Low level languages are machine language(instructions in binary) and assembly language. C is mostly called "mid-level language" because it gives a lot of low level control. But, generally the idea is that high level languages should give you a source code that should be portable to any architecture. Machine and assembly code work for a particular architecture only and need to be re-written if they need to be ported to other architecture.
Even IIT faculty can't teach in such better way
when they started teaching rather than torturing the students
@@raviprakash9215 Why did both of you go for IIT? You could have gone to Harvard or MIT or Caltech maybe you can get into Harvard 8 times but not IIT because JEE is the rest exam in the world.
@@aaryanpakhrani5671 Nice joke,by the you can't deny that professor of premier institution of India are not at all good at teaching they have only big certifications awards and degree that worth nothing if you come to attend class of that professor.
yes the teachers of iit are also not that gud cause i have cleared iit last year so i know d reality
*My takeaways:*
1. Limitations of arrays 0:18
2. Linked list 7:43
3. Unlike an array, we can't access an element of a linked list in constant time O(1) 14:29
4. The time for accessing an element of a linked list is O(n), for inserting an element to a linked list is also O(n) 15:06
5. Benefits of linked list 16:29
If I was memory manager, I'd be like "Make up your damn mind, Albert!"
That look on memory manager's face is real though😂
My dream is to become a Software Engineer in the Bay Area, and as I sit through my first Data Structures and Algorithms course, and cringe at the explanations given by my professor and barely understand other concepts so far, this explanation of Linked Lists give me hope. Thank you so much for paying forward your knowledge, and presenting it in a way that I could understand it.
i have the same dream , keep it up u will make it!
@@oscarwang7920 - Just keep learning, guys. You _will_ get there. Sometimes, a particular concept doesn't make proper sense until you understand other, related concepts, so you have to press on with a partial appreciation during the interim, but, your patience and dedication will pay off. Wizardry is very rewarding, in all kinds of interesting ways.
it's been 2years how are you doing now ?
@@wailbrch4071 LOL I bet they working at google right now
why the fuck am i paying so much to attend a college when i get free online tutorial from youtube? 15 weeks of college which is so compact and dense and i learn more from youtube since they cant teach
Can't imagine a guy with such knowledge can go to the bottom and explain the stuff in such a way is the biggest gift that a guy can have. Thank you.
I studied for over an hour and understood nothing of Linked List. I got the gist in 10minutes from your video. Thank you so much. :) :)
Apeksha Contractor We have a playlist on Data structures - Introduction to data structures
+mycodeschool
plz help,
I don't understand when he says that insertion of a node will take O(n), howwww...........???
i think just two replacements of Link values happened so it shoud be O(2), right???
so confusing... :(
Introduction to linked list
muhammad waqas its not constant to say o(2) and there's no O(2) in Big O notation ... Also you don't know how many process you need to do (you don't know the linked list size ) So Its (n) processes ... I hope you got it :)
muhammad waqas Because it's worst case scenario, meaning you probably will have to travel n nodes to insert.
O(n) means that the order of operation is proportional to n (number of elements), and that in the worst case you'll have to traverse the entire list.
We have some important examples of data structure and linked list, you can visit tutorialgyan.com/what-is-linked-list-c-with-example/
this is great i am glad that you make this course for free, this means so much to me. It's really sad i heard that you passed a way this is such a big lose you are such a talented man, Rest in Peace man
Sir, that was so perfectly explained. The storytelling does wonders in explaining. Amazing work!
I bet nobody on you tube can explain as good as you : A genuine compliment straight from my heart after watching it :)
unfortunately the guy died so he can't see all this love :(
@@oliverbeck6839 No, he didn't. The guy who died was the founder. The guy in the video is the co-founder,
Great explanation man. I wish my teacher taught the same in this way. Keep it up. You are making lots of lives easier.
I cannot understand how anybody can disklike your videos. They are so well structured, considered and explained. Absolutely amazing. Dont give a .... on them who dislike your videos and keep up the good work.
I have no words to describe how you helped me with you video tutorials. Thank you very much.
Mind blowing tutorial,never seen any better tutorial than this on linked list.Thanks a lot man
Holy hell - I've looked through a lot of videos/courses and have yet to see an explanation of Data Structures that is this clear and intuitive. Seriously, thank you so much for this. The pictures and metaphors really makes concepts clear.
This is just what i needed to keep progressing. So glad I found this playlist! thanks for teaching.
Sir, how can i thank you. I was crying deeply because this linked list , stacks , etc was hard to understand for me. But now i have you :)
Memory manager is like "ah shit here we go again!"
🤣
😂👌👌
hahahah
Lmfao
bruhhhhhhhh
DUDE!! YOU ROCK!! You demystified linked list for me in 13 minutes! Best teacher ever!
I usually dont like videos after I watch any video but this guy explained in such a way I could resist myself from liking it . I wish he may find peace wherever he is at
Wow, I really liked this one video. And it motivated me to go on with my self studying❤
i have never seen a style like that dude your style is good and also adding a subtitle is so usefull thanks for everything
The best video about linked list. Clear understanding. Thank you very very much....
After roaming everywhere on the planet of the web to learn DS finally I got the right place.Thanks to god ..you explanation is tidy and clear
Believe me Sir...you are the God of Explanation!!!
The best video on linked list I have ever seen. You are one of the best pedagogical Teacher in the world and The best in this topic
part 2... In Java, you can create a class class Node {int data; Node next; } and you will be good because classes in Java are automatically created on Heap (dynamic memory) and are referenced by variable name. To know more about stack and heap, see our series on pointers for a lesson on dynamic memory allocation.
The best material ever I have seen to explain linked list.
Great job...
I can't thank you enough! You're the only reason I understood my computer portions for the exam! Keep up the good work bro!
Thanks Albert!
Finally, someone just demystified the understanding of the Linkedlist.
Important to understand Memory Bytes assignments to Nodes. Once you understand behind the scenes about the Memory Bytes Assignment for the Head Node and all the Nodes in the LinkedList, and then, the game is over, and you can be traverse the LinkedList as you want and delete any Node you want in the Linkedlist.
In C, structs are not created on heap or what we call dynamic memory. So, if you just create a Node normally , it will go on stack. Anything on stack is freed from memory once a function call finishes. You want to keep a node in memory till the time you want. So, you use malloc in C or new operator in C++. A node created using malloc has to be referenced through a pointer. That's why we have to use Node*. contd to part 2..
Dude you have no idea how much the scenarios helped. I wish my professor explained things like this instead of reading off of 90 powerpoint slides. I wrote it down in my notebook the same way you explained its really helped a lot.
Enrolled in cs50 didn't understand anything on lecture about data structure because the lecture kind of just sweeped through lots of data structures without in depth explanation, but just the basic concepts of each, so now im struggling to do the assignment, and I saw a vid recommending your channel and I'm not dissapointed so far.. Thank you so much for this vids helps a lot
This is one of the best tutorials you will ever find. The least we can do is disable the adblocker, since views with adblocker enabled don't get monetized.
The day after tomorrow is my exam and I don't even knew why linked list is so important. This is the best video on Linked list. Nicely explained. Thank you very very much sir. God bless you...
This video is the best explanation of linked list on RUclips. IMO. Thanks so much.
I study at one of the top CS universities in the world, but I still don't understand what my professor says. You explained WAY better than my university professor. Subscribed. Thanks a lot!
Man, this video is the best way to describe the linked list! Finally, I understand it! thank you bro!!
This actually helped me out quite a bit. Your videos have great quality and I appreciate the jump-cuts when you're drawing and the accurate subtitles. Thank you.
It's my first time to learn link lists during summer class which is only 6 weeks. I wish my professor began the class with an explanation or rather an illustration such as this one. After watching this I can clearly understand what link lists are all about. Thank you
This playlist is the best data structure playlist i have ever seen.
Beautiful Explanation! I think this is the first time I have understood what linked lists are! Fluidic demonstration and wonderful manner of progressing on a topic.
I love this tutorial but have not watched it yet because of my hearing-impairment i cant hear what is being in this video :(
So please get me their subtitles so i can use them to add it on it using VLC player. Thank.
Leslie Joe You can turn on subtitles on YouTUbe, We have it here.
mycodeschool Okay. I really meant that i want to download their subtitles in srt format for these video tutorials (already downloaded) for offline use. Please if u have them, let me get them through my email:- joe198930@gmail.com. I look forward to it. Stay blessed.
Thanks alot
420
You cannot add a new element unless you create a new array of larger size. That's what we are saying.Vector is built on top of arrays. In vector implementation, when array gets filled, we recreate a new array of double the size of the previous array and copy the content from the previous array to the new array. We keep doubling the size of the array each time it gets filled. If we use dynamic memory allocation for arrays, we may sometimes be able to extend the same array using realloc function.
Excellent, I have spent a hell lot of time to understand linked list, but your tutorial is like magic !
this is the best video tutorial one can ever come across....thank you so much :)
you managed to explain linked list well to me than my teacher couldnt explain it in a week , lovely guide. thanks :)
Your content is on a different level than other youtubers who are making similar study content. When I start seeing your video I get assured in the beginning that I will understand the concept. Thanks for giving that confidence to your viewers through that content. cheers
one of the best tutorial for linked list explained for free of cost...god bless u
Thank you so much for your explanation. I couldn't get along with this class for 7 weeks, till i found you.
Many thanks guy. The way you teach us is like telling a story. I really enjoy your story!!!
if someone doesn't understand this ,then its better that you leave IT field and become something else!!!!!!!!!
This is the best ever explanation possible.
My god ,By far the best explanation I have ever studied.
Thank you so much
Sir, thank you so much. Your explanations are so clear, and you make data structures fun to learn.
HIGHLY EFFICIENT....no fuss..just straight to the point...SUPERB...
Wonderful video. Cleared everything up
I was struggling to get understand and how to implement this linked-list ..but this cleared my many concepts....May Allah show straight path to u brother.....
Allah isn't real. Free your mind.
Jimmy Watson I would quote a dialogue from the famous movie Matrix, " What's real NEO? If real is something that you can see and feel and touch, then they simply are electrical signals generated by your brain." Allah, God or anything you want to name it is a question. A question, "What's the source of our creation?".. And as the Buddhist say, till the time you do not know the answer, you should say "I do not know".. I call Allah or God a seeking, an attempt to answer some unknowns, a submission to some higher energy in which we all dissolve. Whether its real or not is a conclusion and I cannot draw it. I am certainly accepting Rahim's wishes. And I am accepting your reasoning too. :)
Jimmy Watson Please dude watch the video and write comments for it. Why are you offending others beliefs. This video is not about religion
tania rahman may allah bring us lots of watermelons and KFC!
Hello there! Mr. T!
This is the best teaching ever.Simple & easy to understand.I hope i can keep going by watching ur videos!❤😄
AMAZING teaching, I’m speechless
This chanel is about strong programing foundation exactly 💯
Explained brilliantly!Our college professors should teach like this.I was having a lot of troubles in understanding,feels like i am going on the right rack now.
This video made be believe that I don't need to be an iit alumni to be good at computer science.....the topics are so vividly explained....thnx sir
Thank you for this explanation! I had some knowledge of how linked lists worked, but my knowledge was limited and convoluted. This video answered many of my questions. Thank you. Great video!
Theses tutorials are life savers !
beautifully explained. Best for those who are purely new to the linked list .Good Job (y)
this is a fantastic video - especially the description on how memory is allocated differently between arrays and linked lists! thank you!
You are an amazing teacher. Really, your communication skills are extraordinary.
This Video is simply superb ... Your way of teaching remarkable.. Thumbs up for you
the best code youtuber ever
the real art of teaching...good job bud
I am so glad I found this video series. I was about to go fail my mid-term but now I have a chance
Best tutorial i have ever come across..Excellent..!!
i start today with these course my goal to start freelancing in 1 year so i hope i get my goal
Very great , thank you sir
Tommarow is my exam..
It helped me a lot because i understand the principle......,. Not like byhearting it....thank you.......sir
Sir, you are the hero of computer science, I hope the best in your life, thank you best teacher
This is probably the best explanation ever!
This is what we call teaching. Excellent!!!
what a great video, all the doubts got cleared i.e why the address block is included int the node , ur way of teaching is awesome loving this . thanks for such a video
thank you so much. ive gained a much better understanding of data structures and memory because of you.
This guy has a talent in explaining things. He is probably a mathematician. Keep up the good job.
P.S. ("Disjoint". I know what you're refering to :3 Weidmans Heil)
This is the best possible explanation for beginners. Neatly done!!
i just cant express my feelings how happy i am . thank you so much for helping us out.
Really easy and clear explanation. This is what education should be. Thank you.
I just love the way u explain things..I wish you were my teacher...but Yaa I loved it..thank u so much...
Man this was a way easier to understand explanation than that from my lecture notes... thank you so much, I have a test tomorrow
int* will store address of integer and not address of node. You need a pointer to node to store the address of node. Where exactly do you want to create an int* ??
Excellent brief on "introduction to linked list".
Crystal clear explanation with nice story. Thank You very much !!!.
And your voice is so nice to listen ...
Explained in simple words. Easy to digest. Great Job Done...
U r awesome, your way of explanation is simple and very useful and your accent is very good and very clear. Thank you for your videos and keep up.
Thank you so much for this video, you have managed to explain a concept that is hard for a beginner like me (May be easy for others) in such a beautiful and simple way! I wish you all the best for the future!
Wow I've never heard of such a simple explanation!! Beautiful!!
It is 2020 and this video is by far the best and amazing and super helpful! Thank you.
What a fantastic video. I love how much there is to learn online these days. I need to learn more about data structures to be a better programmer and I also want to be prepared for when I eventually start my Bachelors level classes in my Computer Science degree. I saw the use of a LinkedBlockingQueue in a game programming series I'm going through which led me to Stacks and Queues, and then Linked List, and next is Blocking Queues
Excellent videos! Perfect pacing...not too fast, not too slow!
Sir you're the best teacher!! Please keep uploading videos to help us!!