your videos are the only ones on youtube that seem to explain the concepts of linked lists and pointers in a clear and concise way. invaluable help. thank you so much.
***** The second line doesn't make any sense. Firstly, you're trying to cast the return value of malloc (a void pointer) to a Node. You can't do that, they're different types. In C++ you need to cast it to a pointer of type Node* (as the first line does). This cast is not required if you're in vanilla C. Even if the right hand side was correct, you then would be trying to assign a pointer to a Node * to a Node. You can't do that for the same reason as above, they're two conflicting types. The whole point (lol) of malloc is that it returns to you a pointer to some memory out on the heap and therefore you can only ever assign the return value of malloc, to a pointer.
+Gaming News Sir I think , First statement is points to a void pointer variable allocated by dynamic memory allocation. but Second statement is a simple variable which is allocated by dynamic memory allocation and converted in node variable by using explicit type conversion.
I recently discovered your videos. Many years ago I was a programmer with weak knowledge of data structures. Now, I've decided to gain a firm understanding of them. I've viewed several videos and am currently reading a book on the subject matter. You have managed to explain data structures so clearly that the seem so easy to understand. You are an outstanding teacher. Thanks for your videos.
I have been trying to understand the actual coding concept of linked lists for about a week. I searched through countless videos, help forums, asked friends and this video right here was the most informative, easy to grasp explanation I have seen. Thank you more than you know
I advise you to go on career teaching people coding and computer science. You would be winning top awards each year. Never in my life did I see better explanations than you videos. Your playlist only on Data Structures is worth at least 200 bucks as a course online :}
Sir, you just helped save my student backside, may whatever gods you worship give you money, children, whatever you want. Your lesson is the only one, that helped me understand the idea behind linked lists. I guess i'm too stupid for any other source. >.
to create a structure type variable, you have to use "struct" keyword. If you have a structure named Node, and if you declare a Node structure type pointer variable and then store another Node type structure variable into that( link), you have to use pointer to "Node type pointer variable" to access the stored "Node type structure" contents in that particular pointer variable(in this case Node type pointer variable "link"). Hope you understand.
Man..... i dont know how to thank you ... tomorrow i have practical exams and i could've learnt the code by heart and went but this explanation was just awesome can never forget this !! superb !!
Thank you for creating this content. I am a computer science major that spent my first two years of college developing skills related to the humanities. To do so, I lost track of the stem framework. I lost the assumed or assimilated aspect of what makes a cs major a cs major. This video triggered the neurons I needed it to :)
i have seen many coding videos on TH-cam. but this channel has always provided me with the best explanations so far. thanks a lot for all your amazing videos.
THANK YOU SO MUCH! Your video is the only video that is short, concise and easy to understand! It is so much simpler to understand link list now! Thank you soo soo much :D
Omg I read multiple explanations of linked lists online and in a text book but I still couldn't grasp the logic behind it. But you did it (also thanks to previous video about memory). You have a gift of explaining clearly and easily! Thank you!
I really felt in love with this channel the contents are very helpful before I hate this course in my college but for now I am really excited about thank a lot man for helping learners for free
Why..just why..cannot (ANY) university professor explain it as simply as this guy..thank you so much.. explaining coudnt be made simpler ugh, amazing dude, amazing
These videos are damn usefull...u are one of the best teacher here in youtube i have come acrossed....keep up the work...there are many students how need videos like these to enhance there skill!!! Thanks A LOT for your help REGARDS AYUSHEE TIWARI(M.P)
Thank you so much! I would want more advanced application examples on linked list if possible! Love video lecture because I can pause and think and work on the understanding before moving on. Learning-on-demand!
Thanks for explain the implementation in C/C++ Other videos just explain the idea but not explain how the implementation looks like in C/C++. Thank you very much!
I am a computer science student and whenever I don't understand specific concepts in the data structure and algorithms, I will log in to my youtube account and then watch videos like this, finding that most of the professors in the university can only read PowerPoint which is lack of clarity and engagement. I do think that if professors can teach their students in this way, things will really get easier.
For those looking for java implementation. This can be converted easily to a generic implementation. public class LinkedList { private final Node head; public LinkedList() { head = new Node(); } // 1. Insert data. public void add(int data) { Node address = head; while(address.next != null) { address = address.next; } Node newNode = new Node(); address.next = newNode; newNode.data = data; } // 2. Traversal public void print() { Node address = head; if(address.next == null) { System.out.println("Empty"); return; } while(address.next != null) { System.out.println(address.next.data); address = address.next; } } /** * Private static inner class to create a node for the linked list. */ private static class Node { private int data; private Node next; } }
Inside the while loop at 11:17 shouldn't the condition just be temp1 != NULL. temp1->link points to the link that the next node stores. So if the linked list contains only the head and one node temp1->link is NULL because it is the last node and it will not go inside the while loop. So if we want to print the values inside the while loop it won't print anything in this case. Can anyone explain to me?
at 11:02 to insert the newly created node to our linked list, instead of traversing the whole list from start to reach the last node, wouldn't it be more efficient if we could have just created a new pointer p and equate it to the temp (note that temp was initially pointing to the 2nd node before we modified it) so that p now points to the last node?
Hi, thank you for this wonderful playlist to help programmers in their struggle to grasp these basic concepts ! Also, another thing, would it not be better to keep an "end" pointer at the end of the linked list each time we added an element at the end. That way it would be faster to add element at the end of the list..
Thanks a lot. I have been following your videos for quite some time, and they have been the best help so far. All the concepts are explained in such a simple and easy to follow manner. With Linked List, is it possible for you to do it java for once. Any help or suggestions are much appreciated.
Your set of videos are the best. I'm studying these concepts now, but it's hard for me to understand the use of these in real life. Am I ever actually going to use these concepts to develop software in the real world??
hey guys i tried to write these code in my computer. I use code blocks. And there is an error in the line Node* link; says that Node is uknown type name. But he already define in the struct Node right?
In this lesson you said the address of the head node is never modified, but we are actually modifying the head node to temp right. temp->data=2; temp>link=null; A = temp; Now the head node is pointed to the first block of memory
hey, this video was very helpful for me to understand the syntactic flow of linked list and pointers. But I think there is a huge flaw in the step temp1->link = temp. Temp is pointing to the latest malloced memory, but when traversal, temp1 will stop a node before the final node, the node(can say node-1) whose link is NULL, that point where we want to stop. But this step will assign pointer of the last node not the second last one. If you think I am missing something and maybe wrong, please clarify. Thank you.
I am a bit confused at what is the node*? I know it means the pointer to node, so does node* mean “a pointer variable which stores the address of the next node”?
Hi, great vid.. I got i doubt here. Could we have used A directly instead of creating a temp varibale. Like the following instruction: A= (node*)malloc(sizeof(node)); before allocating values to the head node.
HEY my code school your tutorials are excellent. I have one doubt in this tutorial where we create a new temp1 variable. When we want to link the nodes why can we write temp->link=100. What is the purpose of creating the node*temp1 and how does the linking process take place with temp1. I am getting a little confuse. Please help
your videos are the only ones on youtube that seem to explain the concepts of linked lists and pointers in a clear and concise way. invaluable help. thank you so much.
Brendan Milton You are most welcome :)
***** The second line doesn't make any sense. Firstly, you're trying to cast the return value of malloc (a void pointer) to a Node. You can't do that, they're different types. In C++ you need to cast it to a pointer of type Node* (as the first line does). This cast is not required if you're in vanilla C.
Even if the right hand side was correct, you then would be trying to assign a pointer to a Node * to a Node. You can't do that for the same reason as above, they're two conflicting types.
The whole point (lol) of malloc is that it returns to you a pointer to some memory out on the heap and therefore you can only ever assign the return value of malloc, to a pointer.
+Gaming News
Sir I think ,
First statement is points to a void pointer variable allocated by dynamic memory allocation. but
Second statement is a simple variable which is allocated by dynamic memory allocation and converted in node variable by using explicit type conversion.
seriously dude you are a gift to us noob coders
I agree!! text books and reference books are just way too complicated for beginners to understand. he's amazing
I recently discovered your videos. Many years ago I was a programmer with weak knowledge of data structures. Now, I've decided to gain a firm understanding of them. I've viewed several videos and am currently reading a book on the subject matter. You have managed to explain data structures so clearly that the seem so easy to understand. You are an outstanding teacher. Thanks for your videos.
I have been trying to understand the actual coding concept of linked lists for about a week. I searched through countless videos, help forums, asked friends and this video right here was the most informative, easy to grasp explanation I have seen. Thank you more than you know
I advise you to go on career teaching people coding and computer science. You would be winning top awards each year. Never in my life did I see better explanations than you videos. Your playlist only on Data Structures is worth at least 200 bucks as a course online :}
Thanks a lot MrValentas :)
He already is software engineer at Google
@@amritaanshnarain7524 really ?
@@Shubh4m15 Yes
are you still a live after 8 years
Sir, you just helped save my student backside, may whatever gods you worship give you money, children, whatever you want.
Your lesson is the only one, that helped me understand the idea behind linked lists. I guess i'm too stupid for any other source.
>.
i dont know why people are disliking your videos really you teach linked list in a very simple way and explain all the things in it
really mindblowing
THIS IS GOLD..YOU DESERVE EVERY PENNY I GAVE TO MY COLLEGE
i will be graduated from youtube instutue of technology!
to create a structure type variable, you have to use "struct" keyword. If you have a structure named Node, and if you declare a Node structure type pointer variable and then store another Node type structure variable into that( link), you have to use pointer to "Node type pointer variable" to access the stored "Node type structure" contents in that particular pointer variable(in this case Node type pointer variable "link"). Hope you understand.
www.mukeshrajput102.com/2017/12/write-c-programs-to-implement-double_11.html
@Anonymous Darkhorse its nomenclature you can't change name for keywords
:)))))))
YIT yay
These videos are really good! Thank you so much! You can't imagine how much I've struggled trying to learn linked lists.
Indians IT teacher are the best in the world
how do you know he's an IITian?
Roushan Giri 'IT' :/
He is Indian dude...check his facebook page (OR) just search on google.
And IITian as well...Animesh Nayan (check on LinkedIn!!
IIITian ,extra i..
You are THE man, I have a linked list lab tomorrow and you have officially saved me. Thank you so very much. 5/5
Man..... i dont know how to thank you ... tomorrow i have practical exams and i could've learnt the code by heart and went but this explanation was just awesome can never forget this !! superb !!
Thank you for creating this content. I am a computer science major that spent my first two years of college developing skills related to the humanities. To do so, I lost track of the stem framework. I lost the assumed or assimilated aspect of what makes a cs major a cs major. This video triggered the neurons I needed it to :)
One of the best explanation about Linked list on youtube...Thanks a lot @mycodeschool brother...
P.S.: Who is watching this in 2020..?
Sir, you explain things incredibly well,largely because your diagrams are so clear and colour-coded.Thank you!
i have seen many coding videos on TH-cam.
but this channel has always provided me with the best explanations so far.
thanks a lot for all your amazing videos.
Hey I first click the like button then I navigate to your content.man you are just beyond the boundary.life saviour for us.
Wow, this is so much more easy to follow than my professors college.
+ratelslangen yeah~the same feeling.
This video literally saved my life. Absolutely NOBODY else explains code better than this channel! Bless you!!!
THANK YOU SO MUCH! Your video is the only video that is short, concise and easy to understand! It is so much simpler to understand link list now! Thank you soo soo much :D
Omg I read multiple explanations of linked lists online and in a text book but I still couldn't grasp the logic behind it. But you did it (also thanks to previous video about memory). You have a gift of explaining clearly and easily! Thank you!
I went trough a couple of videos on this topic and this is by far the best imo
Best lessons ever. Have understood data structures in its entirety. You are an amazing teacher..!!! thank you so much for your free lessons
You are an amazing teacher!!! Your videos are better than reading many books...Thanks
Sir you are the greatest coding teacher in the whole world !!
You have helped me score 95 marks in c in my school! Thank you
I really felt in love with this channel the contents are very helpful before I hate this course in my college but for now I am really excited about thank a lot man for helping learners for free
thank you sooo much..it helped me a lot,my tutor had completely confused me.But your explanation seems so easy and simple.well done!
Why..just why..cannot (ANY) university professor explain it as simply as this guy..thank you so much.. explaining coudnt be made simpler ugh, amazing dude, amazing
because they don't want to
These videos are damn usefull...u are one of the best teacher here in youtube i have come acrossed....keep up the work...there are many students how need videos like these to enhance there skill!!!
Thanks A LOT for your help
REGARDS
AYUSHEE TIWARI(M.P)
u'll get 5 star room in heaven for sure
Even if he doesn't we are going to pray for him so he does.
time bomber?
Reading this just after reading he actually died.
@@nikolayandcards wait actually
@@rahulsiddharth554 yup in a car accident in 2014 or 2015 I guess. He was a IIIT Allahabad student.
Thanks man ! Would've preffered keyboard written code, but, I do like the human touch :D Keep up the good work !
You explain things so well especially coordinating between graphic presentation and the code.
Thank you.
Thanks a lot Shoib :)
Sir, What can i say about your teaching the way you make concept so understable is amazing .., We 'll always be your grateful for this
The best explanation I have seen ever. Thank you very much indeed.
I remember studying this during my Engineering. Never understood the first time but 2-3rd time understood everything. Thanks for helping.
This was amazingly helpful. You are clearly gifted at teaching these sorts of subjects. Thank you so much for these videos.
Thank you so much! I would want more advanced application examples on linked list if possible! Love video lecture because I can pause and think and work on the understanding before moving on. Learning-on-demand!
Very helpful, I was having trouble with traversing linked lists, and then finding the maximum value, but this helped a lot!
You are a fantastic teacher! The best until now for me.
this video is so useful, elaborate, thorough, and well explained that I use it just to brush up my memory of implementing a linked list in java lmao
Thanks for explain the implementation in C/C++
Other videos just explain the idea but not explain how the implementation looks like in C/C++.
Thank you very much!
Thanks for noticing Anthony :)
These videos are literally gold bars.
Your videos really hold a patient and bold explainations...
Thanks for doing so.
Thankyou so much for your hard work .. Really learnt a lot from your videos ..I wish I could have teachers like you in my college ..
Really amazing Tutorial....clear precise and jargon free....and very clear concepts...Keep up
Thank you. I wish my instructor would teach this way in a logical structure. Your videos are very valuable for a CS student. Well done.
I am a computer science student and whenever I don't understand specific concepts in the data structure and algorithms, I will log in to my youtube account and then watch videos like this, finding that most of the professors in the university can only read PowerPoint which is lack of clarity and engagement. I do think that if professors can teach their students in this way, things will really get easier.
Still the Best Video on the Platform For Sure
Finally cleared all my doubts. Thank you so much sir!!!!
wow you are the best .I appreciate and salute sir
Great job with these videos, you explain things really well. Keep up the good work!
you just got one more subscriber! Your words are golden. If possible, please makes tutorial videos on android development.
this series is a gem...respect u sir
its actually very easy but only when its taught by a good teacher! Thank you so much, was very easy to unterstand!
For those looking for java implementation. This can be converted easily to a generic implementation.
public class LinkedList {
private final Node head;
public LinkedList() {
head = new Node();
}
// 1. Insert data.
public void add(int data) {
Node address = head;
while(address.next != null) {
address = address.next;
}
Node newNode = new Node();
address.next = newNode;
newNode.data = data;
}
// 2. Traversal
public void print() {
Node address = head;
if(address.next == null) {
System.out.println("Empty");
return;
}
while(address.next != null) {
System.out.println(address.next.data);
address = address.next;
}
}
/**
* Private static inner class to create a node for the linked list.
*/
private static class Node {
private int data;
private Node next;
}
}
You have clear my doubts on array and linked list , thanks a lot for making a video.
What a beautiful explanation ❤️❤️❤️❤️
this is 2021 ..but these videos are epic and unique...good videos sir
wow!!!. i am just speechless,amazing content you have,you're superb dude!!!.
You deserve an Oscar award for making ME understand what this nonsense is🙏
GOD BLESS THIS VIDEO. My Computer Science grade thanks you endlessly.
thanks for talking about new node and malloc coz i didn't know about the new node feature of c++
Inside the while loop at 11:17 shouldn't the condition just be temp1 != NULL. temp1->link points to the link that the next node stores. So if the linked list contains only the head and one node temp1->link is NULL because it is the last node and it will not go inside the while loop. So if we want to print the values inside the while loop it won't print anything in this case. Can anyone explain to me?
Amazing channel for programming. You should post more videos....
you make hard topic too smooth..... Thanks Sir
Great work :) Thanks a lot :) you r just awesome man :) u saved my 16500taka because I don't need to retake this course :D :D
at 11:02 to insert the newly created node to our linked list, instead of traversing the whole list from start to reach the last node, wouldn't it be more efficient if we could have just created a new pointer p and equate it to the temp (note that temp was initially pointing to the 2nd node before we modified it) so that p now points to the last node?
THE WAY U FOLLOW FOR TEACHING US is .......oh i cant say!!!!!!!THANKS ALOT..
I Learned a lot here. I came by codeDojo video about data structures
Why are you in the comment section? Go back to study!!
+Livio Biondo lol , nice one :)
ahhahah lol thanks for reminding me
UGH FINE
Thanks haha
Thanks!
Hi, thank you for this wonderful playlist to help programmers in their struggle to grasp these basic concepts !
Also, another thing, would it not be better to keep an "end" pointer at the end of the linked list each time we added an element at the end. That way it would be faster to add element at the end of the list..
Hey I am not able to code this on my IDE can you please please reply me by sending the code to me in the reply section to this comment ?
Thanks a lot. I have been following your videos for quite some time, and they have been the best help so far. All the concepts are explained in such a simple and easy to follow manner. With Linked List, is it possible for you to do it java for once. Any help or suggestions are much appreciated.
Wow, thats a piece of a great teaching work. Thanks a lot, mate!
**subscribes the whole channel**
Your set of videos are the best. I'm studying these concepts now, but it's hard for me to understand the use of these in real life. Am I ever actually going to use these concepts to develop software in the real world??
Thank you so much for the tutorial! clearly you explained better than my prof.
Your videos are so helpfull. I learned a lot thanks to you. Thanks a lot !
hey guys i tried to write these code in my computer. I use code blocks. And there is an error in the line Node* link; says that Node is uknown type name. But he already define in the struct Node right?
Very well explained. I wish I knew it was in C/C++ before I began the video playlist, though.
Hats off to you!!! This video is really very much helpful to me.
best video ever for data structure using c++
thank you so much for uploading the videos .I clearly understanding what is happening back to the program.it is realy rice
Awesome man..I really very thankful to you for this bunch of tutorials. Thank's man. :)
Sir,why did you put braces after node at 8:58(when you were explaining how to write in c++ instead of malloc)
i am getting confused about the syntax between your use of C & C++ .
In this lesson you said the address of the head node is never modified, but we are actually modifying the head node to temp right.
temp->data=2;
temp>link=null;
A = temp;
Now the head node is pointed to the first block of memory
It will be great if you publish a series only on different types of algorithm, implement them and show their application
best ever lectures i had thankyou
hey, this video was very helpful for me to understand the syntactic flow of linked list and pointers. But I think there is a huge flaw in the step temp1->link = temp. Temp is pointing to the latest malloced memory, but when traversal, temp1 will stop a node before the final node, the node(can say node-1) whose link is NULL, that point where we want to stop. But this step will assign pointer of the last node not the second last one. If you think I am missing something and maybe wrong, please clarify. Thank you.
I am a bit confused at what is the node*? I know it means the pointer to node, so does node* mean “a pointer variable which stores the address of the next node”?
Thank you, so clear and to the point, explains the important things!
Hi, great vid.. I got i doubt here. Could we have used A directly instead of creating a temp varibale. Like the following instruction:
A= (node*)malloc(sizeof(node));
before allocating values to the head node.
Thank you so much sir . this video really helped me to understand the linked list .
best videos lectures in the universe
HEY my code school your tutorials are excellent. I have one doubt in this tutorial where we create a new temp1 variable. When we want to link the nodes why can we write
temp->link=100. What is the purpose of creating the node*temp1 and how does the linking process take place with temp1. I am getting a little confuse. Please help
temp already points to the address 100. so writing temp ->link = 100 wiil write 100 in the link of the last node which isn't correct
Very usefull!! thank you so much for explaining in an easy manner.
nice job sir...
love form Pakistan
This is a very clear explanation thanks a lot.
This video helped a lot! Thanks. And one suggestion, the pointer "temp" should be deleted.