Hey Guys, if you want more such tech educational videos on this channel then please support me by subscribing to this channel & also share it with your friends as it helps me create more content just for you ✌
This is the first course in RU-vid which is designed specifically in C++ and data structure, I have never see such topic before. Thank you sooo soooo much. That's what I have been looking for.
This is hands down the best video I've found on RU-vid about linked list data structures. Its quite a considerable part of my university module and this video helped tremendous amounts!
Thank you so much Jake for such a positive feedback. I'm super happy to hear this from you. I would request you to please share this video with your friends too and definitely Subscribe for many such DSA concepts coming up in this course 😇
whenever I can't understand anything from my teacher I don't worry about it because back in my mind I know I have simple snippets and it will help me 100% by watching his video once. You are a blessing brother believe me! keep going on like this.
bro, On whole RU-vid You Are The Only One Who is Capable To teach "Irrlicht Game engine" For beginners As examples Are already given In the irrlicht folder Itself.... Please please Please brother..... If You Can start tutorial Series Of Irrlicht Examples From the folder... I would really Glad, all though I am Not in position To ask, Cuz I am just a small Loving subscriber who is addicted to your content :)
Not really an expert on this topic Kavan. Thank you for your kind words. But currently I am heavily invested on DSA course and its going to take a long time :-)
Thank you! I checked a lot of Data Structure videos on RU-vid but Couldn't find any of them as simple as yours. Thank you. You are the first Channel I have subscribed to.
Oh wow that's amazing to know buddy ✌️ I'm glad my DSA videos were very easy to understand for you. Please do share the videos with your friends. That's the biggest help and support 🙏😁
Yeah I get this a lot but I am grateful to you and so many others who motivate me by giving such wonderful comments. I am happy to hear your feedback. Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇
Data structures series are very much helpful and your way of explanation made it easy to understand such complicated Topics . Thank you so much for this amazing work.
Glad it was helpful! Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇
Most welcome bro. Happy to hear this & thank you very much for your support. Your sharing & support is the biggest help for this channel bro. So please keep doing that 😇
It's a very helpful video like for me as a beginner and I also want to know from you how you understand these concepts because I forgot easily ❤please reply and give me some tips
So a few questions: 1) stacks, queues, linked lists, and other data structures are not something built in to C++ or other programs? Is that right? You have to build them from scratch each time? Or are you just building them from scratch so that we can see what is going on behind the scenes? 2) "The stack" and "a stack" are two different things?
All these data structures along with their standard operations are prebuilt in C++ in the STL library, you can google it. However as you said, to understand the working, we are creating them from scratch. ✌ I am not sure if I understand your question no 2 but yeah mostly they are the same ✌
@@SimpleSnippets to clarify my second question, i mean there is a stack that is contrasted from the heap. it has to do with static vs dynamic allocation as far as i know. I think the stack in this context is not something that you have to explicitly code, but is something default that happens, for example, when calling functions. I just dont know if you are saying that you can also explicitly create a user-defined type "stack".
@@bredmond812 oh yes yes I got it. So when I program is executed it runs in the RAM right so in that RAM we have 2 types of memories. One is stack and one is heap. It's basically just the way the data is organised. Some part of the memory behaves like stack and some part of memory behaves like a heap depending on various factors. Hence you must've heard it. Watch the video on recursive function in C++ playlist you'll understand about that default stack
Really amazing tutorial of DSA I have ever find,. it is soo easy to understand from these videos. Thank you so much for such great content. Much love....😍😍😍😍. Also, a request to u if you can make a tutorial on how to make projects for beginners in different programming languages that will be very helpful for us. At least make a video on topics about the project that as a beginner which topics should we take for making a project.
Thank you Saloni I'm so happy to hear such a wonderful feedback from you. Please support me by sharing our videos and channel with your friends too 🙏. Also check the channel playlist I've got a project course with ASP.NET with C# and MSSQL database web application which is like a full project. I've even got portfolio website development course. So there's quite a lot to explore on the channel. Hope you Subscribe ✌️
Thanks Nayab, means a lot. Please do share the channel with your friends & ask them to join our Subscriber family too😊 that will be the biggest help & support 🤟
I have doubts :- In the array we can use the concept of DMA to solve such a problem as u mentioned in Dynamic size.. right? and so how it became the drawback of the array
if the array has does not have dynamic memory and if we say declare { int a[6] and use only 3 elements} and the rested is wasted.. bt here y cant we use memory management operator like the NEW operator and DELETE operator.
That's great to know Saurabh, please do Subscribe to our channel as we have a lot tech educational content which you'll surely like. Also please do share our channel and videos with your friends too, that's the biggest help and support you can provide buddy ✌
Hello, I have a question: at 15:35, when you want to update a node you have to traverse the linked list, which costs you more time compare to the array. So when you want to add a node at the end of the linked list, as I understand that would be the worst case of editing of node, and you will have to traverse the entire linked list just to add another element to the linked list. So why it looks so easy on your video? That the case 2 append a new node to the end of a list. Thank you for your lectures.
I dont know if your videos will help me or not but i just love getting clear concepts!! btw i am using openfoam to make solvers so will data structures info help me in any way? irrespective of that i will finish your videos, dont worry :D
Its good practice to free it especially in big projects where memory space is important. However in this case for demonstration purposes its not having a major impact but yeah its always better to clear the memory.
You are so welcome. Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇
Thank you Aravind 😇 very happy to hear this from you. Please do share the videos with your friends & ask them to support by subscribing to our channel. That's the biggest help and support ✌️
Thank you Shipra, please do Subscribe to our channel as we have a lot tech educational content which you'll surely like. Also please do share our channel and videos with your friends too, that's the biggest help and support you can provide buddy ✌
Most welcome buddy. And yes I'm working on more videos in DS. Lots to cover but these videos take a lot of time and effort to make as you can see from the video duration as well. Hence taking more time to upload 😅✌️