📚 Learn how to solve problems and build projects with these Free E-Books ⬇️ C++ Lambdas e-book - free download here: bit.ly/freeCppE-Book Entire Object-Pascal step-by-step guide - free download here: bit.ly/FreeObjectPascalEbook 🚀📈💻🔥 My Practical Programming Course: www.codebeautyacademy.com/ Experience the power of practical learning, gain career-ready skills, and start building real applications! This is a step-by-step course designed to take you from beginner to expert in no time! 💰 Here is a coupon to save 10% on your first payment (CODEBEAUTY_YT10). Use it quickly, because it will be available for a limited time. #include using namespace std; class Node { public: int Value; Node* Next; }; void printList(Node* n) { while (n!=NULL) { cout Value Next; } } int main() { Node* head = new Node(); Node* second = new Node(); Node* third = new Node(); head->Value = 1; head->Next = second; second->Value = 2; second->Next = third; third->Value = 3; third->Next = NULL; printList(head); system("pause>0"); }
Please please please cover all the data structure and algorithm (DSA) topics. Loved all your C++ videos but if you cover DSA topics as well, hundreds and thousands will find help.
You can explain very thoroughly . Hands down this is by far the best linked list video I've ever come across TH-cam. Please upload more such content, you have a great skill of expressing your ideas easily to people, best wishes
I've watched a few of your videos and In one of them you mentioned your life-long dream is to be a teacher. You should definitely pursue that dream you're a VERY good teacher!
You are the best Code teacher I've come across Miss Saldina. Teachers like you are what we need. Taking us step by step through concepts with very detailed explanations and implementations. You are just outstanding. Truly impressive work.🥳. You are appreciated all the way from South Africa.
I liked your teaching style you are making your all viewers as a good coder. You clear all concepts easily speaking in english but others not and thats very helpful for all kinds of viewers. Love from Pakistan 🇵🇰❤️❤️
I never comment on TH-cam videos but omg YOU ARE A LIFE SAVER! I've always found difficulty in coding, but thanks to your videos I am slowly gaining confidence. Forever grateful for all the knowledge you are sharing with us!❤
I was so confused about how to insert an node in the linked list but after watching this video I am not confused anymore. Your way of explanation is so good.
I absolutely love these videos! Learning Data Structures and Algorithm implementations in C++ (as well as becoming more fluent with the language). Will be watching much more, thanks for the awesome content, you're a great teacher :D
@@aspabhi31 you will only need pointer to pointer when you want to change the value of the pointer, like in the insertAtTheFront(), you will make the *head to point to the newNode.
@@aspabhi31 We just have the head node address, we have to loop through the linked list until the previous node. That's why we have O(N) for inserting after because we need to loop until the previous node and after that we insert our node
I don't write comments much but i am writing this to thank you for being my savior in my hard times such as my exams lol, you are lliterally the only coder on youtube who i have found to be so descriptive. Thank you for being on youtube .
Love your video! I spent the whole day yesterday and tried to understand what the linked list is. All other videos was confusing but now with your help and I totally get it! Thank you so much!!! Keep it up for the excellent work!
Please keep going. Most people give up making Yt videos. Very articulate explanations. I watched a few of your videos 7-8 months back. The delivery and clarity has improved a lot. And happy women's day. 😎
This definitely helps me to understand the linked list. I searched a video on TH-cam that is spoken in my mother language but all of them were much difficult than yours. In addition, they were too generalized from the beginning, but this point-by-point lecture makes me understand well.
I need to thank ou so much!! I'm on university and have to make a test about data structures in c++, but I had no knowledge of c++ before, only python and a little bit of c, so I first watched your full course video and now I am watching this one, you are amazing!! Also I'm brazilian and your english is absolutely perfect!
was so passionate about coding I'm just a young teenager....I also learnt c++ from an internet website for free....but as my exams approached my mom took my laptop for 2 months ....now I'm watching your that whole c++ video I was very sad about what happened but I'm back again! Thanks Hope you make more cources for different programming languages as well....
Hey Saldina! your videos have really helped me through uni the last 2 days, would you please cover double and circle LL? and defintley some sorting algorithims, keep up the good work!
I wish I had known about this channel during my high school. Data Structures were something that made me get frustrated and unlinked a lot of my brain cells. But it's never too late to learn. Thanks for this video. 👌😊
Just a suggestion especially on data structures. It would be much easier or most peaple to have some graphics. Linked lists, binary trees and so on are hard to explain with just your hands. :-) Thanks for your good work!
Ma'am please cover all data structure and algorithm topics and also it would be very helpful if you give some standard practice questions on each topic, as homework and explain those practice questions in a new video.
Amazing explanation, you have made this very simple and easy to understand. I was facing issue in understanding the insertion operation in linked list. Thanks for this.
beautiful explanation maam!I have gone through various linked list videos ...your video has no match honestly!so glad that I came across this ytchannel...and I must mention that u look beautiful as well maam
Thanks a lot! One question: Why didn't you use pass-by-reference using pointers while implementing the last insertAfter function? You used it in the first two but not in the last one, that confused me a little bit. Other than that, I understood the topic very well. Your teaching is excellent.
I think that is because the insertAfter function does not use head node, so you can easily get the address from the previous node since they are stored in the Next. With the first two functions the address of the head is not stored in any of the node so passing by reference make things easy. I don't know if this answers your question but I hope it make sense.
Your video on LinkedList is super good. Not much tutorial video use C++ to teach LinkedList, and your video are the best. I have a question about why you passing a pointer to pointer in the insertFront and insertEnd function and passing pointer in the insertAfter function.
Wow, Saldina thank you very much. I learned about the linked list in my c++ class course but I didn't understand much. Now I saw your video and it helped me a lot. And one more thing can you please make a video/videos about c++ classes using different(separate) files like header file - c++ file - main function file. Thank you in advance.
I like your videos because they help me to understand a new concept step by step. One quick question: I think the insertAtTheFront() and insertAtTheEnd(), the first parameter can be just *head, and no need to use **head?
sorry if I sound dumb, but im unable to understand the use of pointers and addresses in complex programms, I dont understand why we are sending only "head" as parameter when displaying the linked list 2:47 , while adding element in the start and end, we send "&head" as parameter 5:0920:19 and for adding an element in between two nodes, we send "head" as parameter as well 29:04 .
Hehe, there is quite a lot going on with using pointer to pointer + sending a pointer by reference and Saldina of course knows it :-) Many asked why the address of pointer is used when inserting the node at the front. Here is another way of doing the same which might make it more understandable: Node* insertAtFront2(Node* n, int val) { Node* newNode = new Node; newNode->value = val; newNode->next = n; return newNode; // return pointer to a new head element } The node in front of the others is now inserted by: head = insertAtFront2(head, 201); Since the head (which is pointer to Node) variable has to be changed after inserting a new node in front of the others, the function returns a pointer to a new Node which is then used to update the head variable. Saldina used a function returning void and that's why she had to use another way of updating the head pointer outside of a function - which was to send the address of a pointer (a pointer to a pointer) as a parameter so she could update it by just dereferencing. In my example there isn't a way to update the head pointer by dereferencing the n variable because here n is sent by value and the function is working with the local copy of the head pointer. That's why I had to declare the function returning a pointer to Node and to assign that value after returning from the function.
Finally, I got the topic in my mind :). But I am getting little confused on using the pointer to pointer variable while declaring the function. I know about pointers well as I have watched your pointers playlist as well. But I am still in a bit of confusion.
the 100 comment! Thanks Saldina, I really appreciate all your effort there is something that I do not understand why does insertAtFront receive the addres of the pointer (&head)? why is not enough to input just the pointer (head)? Thanks teacher Saldina!
I've been working on this example several hours by now, I think I've acomplished some graps at pointers. Thanks Saldina, I am understanding more about pointers, they can be hard! answering my own question, it is needed the address of the ptr so you can know where it is, so you pass its address, but to store an address you need a ptr, so it is stored in a ptr, but, the variable you are working with it is already a ptr, so it is needed a ptr to a ptr
I’ve a question about the first parameter of method insertAfter. Why do you use just * ? In my opinion, the previous node is a pointer and the new node is a pointer too. So, why should we use ** ?
📚 Learn how to solve problems and build projects with these Free E-Books ⬇️
C++ Lambdas e-book - free download here: bit.ly/freeCppE-Book
Entire Object-Pascal step-by-step guide - free download here: bit.ly/FreeObjectPascalEbook
🚀📈💻🔥 My Practical Programming Course: www.codebeautyacademy.com/
Experience the power of practical learning, gain career-ready skills, and start building real applications!
This is a step-by-step course designed to take you from beginner to expert in no time!
💰 Here is a coupon to save 10% on your first payment (CODEBEAUTY_YT10).
Use it quickly, because it will be available for a limited time.
#include
using namespace std;
class Node {
public:
int Value;
Node* Next;
};
void printList(Node* n) {
while (n!=NULL) {
cout Value Next;
}
}
int main()
{
Node* head = new Node();
Node* second = new Node();
Node* third = new Node();
head->Value = 1;
head->Next = second;
second->Value = 2;
second->Next = third;
third->Value = 3;
third->Next = NULL;
printList(head);
system("pause>0");
}
di si? pozz iz tz---kakvo je vrijeme u Mostaru?
Thanks for your videos you’re an amazing teacher. I’m paying for university but I learn better from your videos
Why not all the code at the end.
When we are inserting a node after specific node, why are we not passing address of previous node in the function insertAfter?
Share over all code
Please please please cover all the data structure and algorithm (DSA) topics. Loved all your C++ videos but if you cover DSA topics as well, hundreds and thousands will find help.
+10000000
pleeease!
Upppp!
You can explain very thoroughly . Hands down this is by far the best linked list video I've ever come across TH-cam. Please upload more such content, you have a great skill of expressing your ideas easily to people, best wishes
I've watched a few of your videos and In one of them you mentioned your life-long dream is to be a teacher. You should definitely pursue that dream you're a VERY good teacher!
You are the best Code teacher I've come across Miss Saldina.
Teachers like you are what we need.
Taking us step by step through concepts with very detailed explanations and implementations.
You are just outstanding. Truly impressive work.🥳.
You are appreciated all the way from South Africa.
🥰❤️
i love how you pasted the source code right in the comment now thats accessibility
Lol Raw is the new thing
When we are inserting a node after specific node, why are we not passing address of previous node in the function insertAfter?
@@fly4me2night its Savage
@@fly4me2night insane
I liked your teaching style you are making your all viewers as a good coder. You clear all concepts easily speaking in english but others not and thats very helpful for all kinds of viewers. Love from Pakistan 🇵🇰❤️❤️
I never comment on TH-cam videos but omg YOU ARE A LIFE SAVER! I've always found difficulty in coding, but thanks to your videos I am slowly gaining confidence. Forever grateful for all the knowledge you are sharing with us!❤
Great Work !The best teacher I've come across on yt so far!
I was so confused about how to insert an node in the linked list but after watching this video I am not confused anymore. Your way of explanation is so good.
I absolutely love these videos! Learning Data Structures and Algorithm implementations in C++ (as well as becoming more fluent with the language). Will be watching much more, thanks for the awesome content, you're a great teacher :D
Welcome, I'm glad 😃😃
I can't understand my professor at all, and your explanation is amazing. Thank you for this two linked list tutorials!
🤗🤗🧡
@@CodeBeauty When we are inserting a node after specific node, why are we not passing address of previous node in the function insertAfter?
@@aspabhi31 you will only need pointer to pointer when you want to change the value of the pointer, like in the insertAtTheFront(), you will make the *head to point to the newNode.
@@sieghart1931 isn't should be change the address of pointer?
Perfect explanation of inserting a node between two nodes. It took me what feels like forever to understand linked lists, but this helped a lot.
I really appreciate your course about OOP. Thank you so much for that masterpiece work
When we are inserting a node after specific node, why are we not passing address of previous node in the function insertAfter?
@@aspabhi31 We just have the head node address, we have to loop through the linked list until the previous node. That's why we have O(N) for inserting after because we need to loop until the previous node and after that we insert our node
You’re a life saver, your videos are so clear and easy to understand, thank you so much for creating content like this
I love your teaching style because it has made me to fall in love with C++ something I used to fear.
I Know that feel bro
im so happy that you existed! you help me alot through my coding journey honestly you are better than my professor
I spent one month learning this in my class and here everything is explained in just 30min... GOOD JOB !!!
You are the best teacher ever. Period.
🥰🥰
I don't write comments much but i am writing this to thank you for being my savior in my hard times such as my exams lol, you are lliterally the only coder on youtube who i have found to be so descriptive. Thank you for being on youtube .
Love your video! I spent the whole day yesterday and tried to understand what the linked list is. All other videos was confusing but now with your help and I totally get it! Thank you so much!!! Keep it up for the excellent work!
Just in time, i just finished the previous video and boom... another one. You're a speedrunner! 😜
You're currently saving me for my head assignment (a family tree). Thank you!
its very helpful video to every student whose want to learn DSA....i learn in just a 1 hours .....thanks allots from pakistan 👍....
best c++ instructor I have come across
☺️🥰🥰
Thank you so much, I love the way you teach and explain everything perfectly. I hope the best for you in all of your goals and pursuit of happiness.
Your explanations are the best, this is what I was looking for all this time
u explain things 10 times better tthan any professor or textbook has ever for me
Please keep going. Most people give up making Yt videos. Very articulate explanations. I watched a few of your videos 7-8 months back. The delivery and clarity has improved a lot. And happy women's day. 😎
Thank you so much sister for the crystal clear explanation with each line of the code 🎉👍🙏
This definitely helps me to understand the linked list.
I searched a video on TH-cam that is spoken in my mother language but all of them were much difficult than yours.
In addition, they were too generalized from the beginning, but this point-by-point lecture makes me understand well.
best explanation of linked lisgt ever seen on you tube
I need to thank ou so much!! I'm on university and have to make a test about data structures in c++, but I had no knowledge of c++ before, only python and a little bit of c, so I first watched your full course video and now I am watching this one, you are amazing!! Also I'm brazilian and your english is absolutely perfect!
This is a excellent presentation in simple understandable English.
The topic was nailed.
Thank you
Your videos are a refresher to me, I learned these concepts with Pascal a few year ago for the university and I forgot it. Thanks!
Not Gonna Lie...
You did a grate job explaining it
was so passionate about coding I'm just a young teenager....I also learnt c++ from an internet website for free....but as my exams approached my mom took my laptop for 2 months ....now I'm watching your that whole c++ video I was very sad about what happened but I'm back again!
Thanks
Hope you make more cources for different programming languages as well....
Hey Saldina! your videos have really helped me through uni the last 2 days, would you please cover double and circle LL? and defintley some sorting algorithims, keep up the good work!
I found your explanation easiest. I am very happy with your teaching style.
You have been so helpful. You explain in such a simple clear way and so straight to the point . I love your videos.❤♥💗💓
I wish I had known about this channel during my high school. Data Structures were something that made me get frustrated and unlinked a lot of my brain cells. But it's never too late to learn. Thanks for this video. 👌😊
Your explanation skill is great. Loved how you didn't start from a very complex way to implement a linked list✨️
your teaching style i really really perfect
Just a suggestion especially on data structures. It would be much easier or most peaple to have some graphics. Linked lists, binary trees and so on are hard to explain with just your hands. :-) Thanks for your good work!
Ma'am please cover all data structure and algorithm topics and also it would be very helpful if you give some standard practice questions on each topic, as homework and explain those practice questions in a new video.
Wow you really explain these concepts well.
best linked list video tutorial i came across
continue doing all sort of videos your saving lifes
Your explanation is the simplest and best..thankyou for the good work
Amazing explanation, you have made this very simple and easy to understand. I was facing issue in understanding the insertion operation in linked list. Thanks for this.
Explain in such way.. Oh my god... So niceeee.. thanks mam
remarkable piece of Code especially the detailed explanation line by line , thank you So much.
🤗🤗🥰
Superb explaination, thanks for much more clarification in a specific manner
Thanks Saldina, You made it very easy for us to understand these topics. Once again big thanks.
I just discovered this channel - as a fellow female software engineer, it is so awesome to see a woman making coding videos!! ❤
beautiful explanation maam!I have gone through various linked list videos ...your video has no match honestly!so glad that I came across this ytchannel...and I must mention that u look beautiful as well maam
your teaching technique is great!
This video made linked list far more easier to understand. Great work🔥
You’re an amazing teacher. Thank you for your content I really appreciate it.
Most Underrated Channel ever
Thanks a lot. One of the best tutorials I've watched!
you just save my last assignment! Thank you!, you are such good teacher!
You have done an exemplary job!!! .God bless.
Lifesaver.
These pointers -- are treacherous -- there’s no other way of saying this …thank you for your lovely explanation as always…
You're welcome 🥰
great explanation, thank you!
love the outline in comments before you started coding in detail
Hello ! Your lectures are very useful. Can u make more about Dsa like tree, graph etc. Your vedios are more understandable.
yess I will 🤗☺️🤞
God bless you. Thank you so much for the very good explanation
Ma'am keep posting videos on Data Structures & Algorithms . Really love your way of teaching. Keep growing ma'am ❤❤❤❤❤
Best teacher ever.
Thanks a lot! One question: Why didn't you use pass-by-reference using pointers while implementing the last insertAfter function? You used it in the first two but not in the last one, that confused me a little bit. Other than that, I understood the topic very well. Your teaching is excellent.
I think that is because the insertAfter function does not use head node, so you can easily get the address from the previous node since they are stored in the Next. With the first two functions the address of the head is not stored in any of the node so passing by reference make things easy. I don't know if this answers your question but I hope it make sense.
That's a very clear and excellent video on linked lists.
I had a hard times at this but you successfully guided me through 😉
lady. THANK you so much.. you helped me understand this and pass my tests. thank you tahnk you thank you thank you
Your video on LinkedList is super good. Not much tutorial video use C++ to teach LinkedList, and your video are the best. I have a question about why you passing a pointer to pointer in the insertFront and insertEnd function and passing pointer in the insertAfter function.
You are the best in the TH-cam💗
pls i love you thank you so much for your work❤️✨❤️✨❤️✨❤️✨❤️✨❤️❤️✨❤️✨❤️
❤️❤️🤗
Wow, Saldina thank you very much. I learned about the linked list in my c++ class course but I didn't understand much. Now I saw your video and it helped me a lot. And one more thing can you please make a video/videos about c++ classes using different(separate) files like header file - c++ file - main function file. Thank you in advance.
You saved my day ma'am.
Thank you.
Hey wassup I'm your New Subscriber.. I came to your channel After a Video About The Oops Concept in
C++ .
Thanks for the valuable content.
thank you a lot, it really help me for a full comprehension of the topic. Namaste
I like your videos because they help me to understand a new concept step by step. One quick question: I think the insertAtTheFront() and insertAtTheEnd(), the first parameter can be just *head, and no need to use **head?
sorry if I sound dumb, but im unable to understand the use of pointers and addresses in complex programms, I dont understand why we are sending only "head" as parameter when displaying the linked list 2:47 , while adding element in the start and end, we send "&head" as parameter 5:09 20:19 and for adding an element in between two nodes, we send "head" as parameter as well 29:04 .
Beautiful explanation! Thank you so much!
Please take live lecture if possible so that we can ask questions in live chat 🙏🙏🙏 by the ways you are the best teachers for beginners 🥺
For the function insert, why you should use two ** after the Node? For example
void InsertAtFront(Node**, int new_value)
Hehe, there is quite a lot going on with using pointer to pointer + sending a pointer by reference and Saldina of course knows it :-) Many asked why the address of pointer is used when inserting the node at the front. Here is another way of doing the same which might make it more understandable:
Node* insertAtFront2(Node* n, int val) {
Node* newNode = new Node;
newNode->value = val;
newNode->next = n;
return newNode; // return pointer to a new head element
}
The node in front of the others is now inserted by:
head = insertAtFront2(head, 201);
Since the head (which is pointer to Node) variable has to be changed after inserting a new node in front of the others, the function returns a pointer to a new Node which is then used to update the head variable. Saldina used a function returning void and that's why she had to use another way of updating the head pointer outside of a function - which was to send the address of a pointer (a pointer to a pointer) as a parameter so she could update it by just dereferencing.
In my example there isn't a way to update the head pointer by dereferencing the n variable because here n is sent by value and the function is working with the local copy of the head pointer. That's why I had to declare the function returning a pointer to Node and to assign that value after returning from the function.
live long life, thank you my sister, super linked list vedio tutorials
Thanks! Really clear and easy to follow 😃
Bravo for this very educational tutorial!
The video have added more clarity on the coding experience
Great video!! This helped me with a college class where my professor assumes everyone knows this and refuses to teach it loll. Thanks!
@19:14 I don't understand how the while loop keeps iterating through pointers rather than just the the *head. Could you please explain?
i just wanna say thank you u saved me
Hi Great Lady! Thank you so much!!!
Finally, I got the topic in my mind :). But I am getting little confused on using the pointer to pointer variable while declaring the function. I know about pointers well as I have watched your pointers playlist as well. But I am still in a bit of confusion.
Your code is more C-Style than modern C++. Maybe you can do video on how to refactor this code?
the 100 comment!
Thanks Saldina, I really appreciate all your effort
there is something that I do not understand
why does insertAtFront receive the addres of the pointer (&head)? why is not enough to input just the pointer (head)?
Thanks teacher Saldina!
I've been working on this example several hours by now, I think I've acomplished some graps at pointers. Thanks Saldina, I am understanding more about pointers, they can be hard!
answering my own question, it is needed the address of the ptr so you can know where it is, so you pass its address, but to store an address you need a ptr, so it is stored in a ptr, but, the variable you are working with it is already a ptr, so it is needed a ptr to a ptr
I’ve a question about the first parameter of method insertAfter. Why do you use just * ? In my opinion, the previous node is a pointer and the new node is a pointer too. So, why should we use ** ?
structure and algorithm (DSA) topics,love your new look