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 )
@@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
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.
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.
+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 :)
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
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.
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.
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..
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
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* ??
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.
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
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
Albert: I need space for 4 element sized array. Memory Manager: *finds a perfect place between 201 and 216 for this job. Albert after 3 seconds: I want to extend my array by one. *Enya - Only Time plays* Memory Manager: ...
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
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. :)
Wao awesome teaching. How nicely and easily the concept of linked list was explained. Enjoy thoroughly the story of memory manager and Albert. Would like to know the implementation in java. Plz. Do reply
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)
thank you so much for providing me a good base to learn data structures sir. I have doubt here. "struct Node{int data;Node* next }" here what does "Node* next" exactly mean? Is "node* next" and "node *next" same for declaring pointer ? This doubt is making me confused. plz help me get clarified .
I have a request please don't allow advertisements between a video lecture it really is disturbing for me I think that the others are feeling the same about the advertisements. If you do so it will be very helpful. Dhanyavad
I dont know how can thanku sir,but seriously who's many student have's financial problem & they all are can 100% get free classes,we make a wishes U sir!
Thanks for your tutorial, but my listening isn't good. Can you add English subtitles to all your videos? So, it can be much easier to understand the videos. Thanks you very much.
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
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 :/
UA-cam 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?
@@Ftreptp 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?
@@mayank310795 it will not take the between addresses it will create node in another address and just attach it
Memory manager is like "ah shit here we go again!"
🤣
😂👌👌
hahahah
Lmfao
bruhhhhhhhh
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😂
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?
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
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.
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
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/
Sir, that was so perfectly explained. The storytelling does wonders in explaining. Amazing work!
Great explanation man. I wish my teacher taught the same in this way. Keep it up. You are making lots of lives easier.
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
66 dislikes are those ppl who cant event understand after god comes personally to teach them!!!!
exactly
Ikr
hasmat idrisi agreed.
Probably lol
Some people might have found this a bit slow, and not covering other important areas like pointers properly.
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.
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.
I have no words to describe how you helped me with you video tutorials. Thank you very much.
This is just what i needed to keep progressing. So glad I found this playlist! thanks for teaching.
Mind blowing tutorial,never seen any better tutorial than this on linked list.Thanks a lot man
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,
the founder of mycodeschool was from INDIA and was rated one of best coder. but on 2014 he died in tragic car accident.
(U may google him too);
R.I.P
141 dislikes. They must be this channel's rival though.
nah its our professors
The best video about linked list. Clear understanding. Thank you very very much....
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..
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 have never seen a style like that dude your style is good and also adding a subtitle is so usefull thanks for everything
I liked the story concept of teaching.....
i start today with these course my goal to start freelancing in 1 year so i hope i get my goal
masha allha ..brother i like so much your tutorial
"A high level language like C"
by definition, C is a high level language
Very good lesson. Can be supplemental material to other textbooks and resources.
having these videos i dont need my fucking tiddi teacher...........thnx alot bro.may u get more success :)
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* ??
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.
You are legend!Your dedication remind Indians that we teached the World in past(VishvaGuru)
That memory manager guy made me smile
which software do you use to make this video.. also which stylus pen to write... it's awesome...
The(memory Manager) guy is really so cute, he looks so decent. 😛😌
This chanel is about strong programing foundation exactly 💯
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. :) :)
AMAZING teaching, I’m speechless
dude thanks for doing this great thing for all students
so beautifully explained that i'm starting to wonder if he might as well be capable of answering all our existential crisis questions ...
" So Albert is like, what all options do I have ? "
this is the best video tutorial one can ever come across....thank you so much :)
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
i can only imagine how many people got an A after watching this
albert needs hair cut come to my saloon
Believe me Sir...you are the God of Explanation!!!
god have mercy on your soul
Kaash Ap Jaise Koi Teacher Mujhe Lumber 1 mai milta
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
You saved out butt from our report of this.. some heroes dont wear capes.. huhu thx so much
I am in love with Albert.... XD
Albert: I need space for 4 element sized array.
Memory Manager: *finds a perfect place between 201 and 216 for this job.
Albert after 3 seconds: I want to extend my array by one.
*Enya - Only Time plays*
Memory Manager: ...
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
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 :)
Now I understand why Linked List is needed.
Sir, thank you so much. Your explanations are so clear, and you make data structures fun to learn.
RIP mycodeschool
Excellent, thank you so much sir for this great explanation. It couldn't have been explained better than this
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.
Its Jesus Teaching Coding !!
You are an amazing teacher. Really, your communication skills are extraordinary.
beautifully explained. Best for those who are purely new to the linked list .Good Job (y)
Really impressive...thnk u so much for this gr8 tutorial... :)
Man ! You are truly gifted..!! Thanks for these awesome tutorials :)
Wow, I really liked this one video. And it motivated me to go on with my self studying❤
Theses tutorials are life savers !
came here from chatGPT :)
still one of the best play list
awsome tutorial with a story...easy to understant,very conceptual..thanks..
:') thank you so much man... my childhood dream to learn all these stuff
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!
Your tutorials are very easy to understand.. thank you so much
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!
I am not going to forget linked list at all in future cz of ur explanation .. thanku ..
what was the software u used to make this tutorial please say me
so good buddy....better than the school video lectures..! Awesome... I can't help but say I love you... because it's final time....:(
C is a low level language
Memory manager looks really disappointed...... not gonna lie......
By the way, memory manager looks better than Albert
Wao awesome teaching. How nicely and easily the concept of linked list was explained. Enjoy thoroughly the story of memory manager and Albert. Would like to know the implementation in java. Plz. Do reply
Awesome Lecture........Similarly, can u Please Help With the Pointers and Structures
Thanks For the Help
Can you do the coding about this i mean it is theoretical where is coding video..!
Apologise for Bad English.
You illustration make this abstract concept so dam easy...finally understood it... Big thanks!
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)
One thing I couldn't understand, address is like 200,201,202...But when an integer gets 4 bytes of memory->217,are four bytes together named 217?
thank you so much for providing me a good base to learn data structures sir. I have doubt here. "struct Node{int data;Node* next }" here what does "Node* next" exactly mean? Is "node* next" and "node *next" same for declaring pointer ? This doubt is making me confused. plz help me get clarified .
I have a request please don't allow advertisements between a video lecture it really is disturbing for me I think that the others are feeling the same about the advertisements. If you do so it will be very helpful.
Dhanyavad
who disliked this -_-
This Video is simply superb ... Your way of teaching remarkable.. Thumbs up for you
I dont know how can thanku sir,but seriously who's many student have's financial problem & they all are can 100% get free classes,we make a wishes U sir!
Thanks for your tutorial, but my listening isn't good. Can you add English subtitles to all your videos? So, it can be much easier to understand the videos. Thanks you very much.
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
I regret paying Rs 8000 for codingninjas course which I now think is a completely a ripoff
GREAT WAY TO EXPLAIN.. GOOD JOB mycodeschool..LOVED it!!
+mycodeschool it'll be great if you upload toutorials about the java also...
cany anyone please suggest me the links for java video tutorials :D
You have some godlike explanation skills. I fucking love u man. Instant subscribe.
Hi ,
Thanks for this tutorial.
please help me to understand the the type conversion and type casting. really a freaking situation.
Keep updating sir