It took me about 2 and a half weeks to complete this video. Along with understanding the theory behind these data structures, I also got a firm handle on their implementation in C++. I feel very comfortable going into my actual Data Structures course in university, having studied this video. I thank the maker of this video for allowing me to view it for free. I wish I could like it more than once. A thousand thank you's.
@@nijagunadarshan2529 I took a C course in university and it was a disaster. So over the summer I decided to fill in my knowledge gaps. I started with this video, however i soon realized I need to watch the freeCodeCamp video on C/C++ pointers. So i watched and studied that video and then circled back to this video. Prior to these video I had no experience. The flow was very organized and constructive
@@bluewaveonthewaysidebythepier I would also seriously suggest actually typing out the code multiple times. These data structures are pretty standard and if you can quickly construct them in code youll struggle less with implementing them on your assignments
@@paulwolak6557 i am also trying this, i will start this from today, hope to complete it within this week. i also did that pointer video, it was really very helpful for me.
This legend died when I was in 7th standard, and now I am learning DSA from his lectures in 1st year of my college. Your soul is still alive sir, and you are still a great contributor to the coding community.
Whoever you are, God bless you. You have done service to those who can't afford to learn in an institute. Because of you someone will have bread on their table. Gratitude to mother who birthed you.
One of best teacher i ever seen throughout my life ...literally no one can teach like him...He teaches every single from basic to high advanced level...And one of the best thing is that he teach us where we can make mistake and how solve it with full explanation....hats off to such amazing teacher... Thank you so so much...
Harsha Suryanarayana was a legend and the best competitive coder to come out of India. His works didn't go in vain, he still live for next 100 years due his knowledge sharing. Rest in Peace my teacher :)
This tutorial is OMG!!!! One of the best CS Tutorials on youtube, let alone in DSA. If anyone is having second thoughts about watching this one, lemme assure you, this is hands down the best one in DSA. Kudos to the great duo of Animesh Sir and Harsha Sir (rip).
heartfelt tribute to Lord Harsha. May his name and memories continue to inspire Indians across the globe to strive for excellence while being humble at the same time
Salute you sir, for this huge amount of work you have put in. Whether you are in Heaven or Earth, may you and your family be blessed always. I have an interview tomorrow. I don't know how it will go as I am from mechanical background, but I really love programming and data science. Whatever be the result of the interview, I will always be thankful for this video.
@@sohagpage7482 Yes! The earlier the better. School won’t teach you until your 3rd/4th year, while the internet can teach you right now and you’ll be ahead of your peers
I was about to comment that how helpful this video is and I really wanted to thank the maker to make it available for free. But I read some comments about his death and if it is really true, this breaks my heart that the world lost such a great teacher. The way he is teaching in the videos is exemplary. May his soul rests in peace and I hope more and more students find this video. Thankyou very much sir, wherever you are.
ecie to track progress step by step as encouragement (previous steps have been deleted because I edited): progress: 5:11:00 progress 7/26: 6:04:34 progress 7/27: 7:25:00 progress 7/29: 7:42:00 progress 7/30: 8:17:53 (finished trees wish there was more on general trees rather than just BST and how to turn a normal tree into a BST) progress 7/31: FINISHED 🔥🔥🔥
Thanks guys, this is just perfect cause I've been trying to understand C and C++ in-depth coming from a web dev background using PHP, Python, JS and such.
funny, im trying to learn web dev, ive used C, C++,Java and C# , but ive never touched python, javascript or html. I only did a little CSS because the GUI's i made in C++ and Java most of them used stylesheets
you guys are amazing. This is like the best youtube channel to learn. I have never seen anything like this channel. It's short, concise and straight to the point
Course Contents ⭐ ⌨ (0:00:00) Introduction to data structures ⌨ (0:06:33) Data Structures: List as abstract data type ⌨ (0:19:40) Introduction to linked list ⌨ (0:36:50) Arrays vs Linked Lists ⌨ (0:49:05) Linked List - Implementation in C/C++ ⌨ (1:03:02) Linked List in C/C++ - Inserting a node at beginning ⌨ (1:15:50) Linked List in C/C++ - Insert a node at nth position ⌨ (1:31:04) Linked List in C/C++ - Delete a node at nth position ⌨ (1:43:32) Reverse a linked list - Iterative method ⌨ (1:57:21) Print elements of a linked list in forward and reverse order using recursion ⌨ (2:11:43) Reverse a linked list using recursion ⌨ (2:20:38) Introduction to Doubly Linked List ⌨ (2:27:50) Doubly Linked List - Implementation in C/C++ ⌨ (2:43:09) Introduction to stack ⌨ (2:51:34) Array implementation of stacks ⌨ (3:04:42) Linked List implementation of stacks ⌨ (3:15:39) Reverse a string or linked list using stack. ⌨ (3:32:03) Check for balanced parentheses using stack ⌨ (3:46:14) Infix, Prefix and Postfix ⌨ (3:59:14) Evaluation of Prefix and Postfix expressions using stack ⌨ (4:14:00) Infix to Postfix using stack ⌨ (4:32:17) Introduction to Queues ⌨ (4:41:35) Array implementation of Queue ⌨ (4:56:33) Linked List implementation of Queue ⌨ (5:10:48) Introduction to Trees ⌨ (5:26:37) Binary Tree ⌨ (5:42:51) Binary Search Tree ⌨ (6:02:17) Binary search tree - Implementation in C/C++ ⌨ (6:20:52) BST implementation - memory allocation in stack and heap ⌨ (6:33:55) Find min and max element in a binary search tree ⌨ (6:39:41) Find height of a binary tree ⌨ (6:46:50) Binary tree traversal - breadth-first and depth-first strategies ⌨ (6:58:43) Binary tree: Level Order Traversal ⌨ (7:10:05) Binary tree traversal: Preorder, Inorder, Postorder ⌨ (7:24:33) Check if a binary tree is binary search tree or not ⌨ (7:41:01) Delete a node from Binary Search Tree ⌨ (7:59:27) Inorder Successor in a binary search tree ⌨ (8:17:23) Introduction to graphs ⌨ (8:34:05) Properties of Graphs ⌨ (8:49:19) Graph Representation part 01 - Edge List ⌨ (9:03:03) Graph Representation part 02 - Adjacency Matrix ⌨ (9:17:46) Graph Representation part 03 - Adjacency List
Before commenting I just read one comment that you are not with us .and I shocked 😱🤯 rest in peace. Thank you so much for sharing knowledge. Before watching this video. I was scary about DS but now I get lot of confidence on this topic. That is only because of you. That voice make me more interesting. But we miss you.
I was halfway through your other data structures youtube video, using it for ç++ until you posted this, can't wait to move into this, always amazing content
⭐ Course Contents ⭐ ⌨ (0:00:00) Introduction to data structures ⌨ (0:06:33) Data Structures: List as abstract data type ⌨ (0:19:40) Introduction to linked list ⌨ (0:36:50) Arrays vs Linked Lists ⌨ (0:49:05) Linked List - Implementation in C/C++ ⌨ (1:03:02) Linked List in C/C++ - Inserting a node at beginning ⌨ (1:15:50) Linked List in C/C++ - Insert a node at nth position ⌨ (1:31:04) Linked List in C/C++ - Delete a node at nth position ⌨ (1:43:32) Reverse a linked list - Iterative method ⌨ (1:57:21) Print elements of a linked list in forward and reverse order using recursion ⌨ (2:11:43) Reverse a linked list using recursion ⌨ (2:20:38) Introduction to Doubly Linked List ⌨ (2:27:50) Doubly Linked List - Implementation in C/C++ ⌨ (2:43:09) Introduction to stack ⌨ (2:51:34) Array implementation of stacks ⌨ (3:04:42) Linked List implementation of stacks ⌨ (3:15:39) Reverse a string or linked list using stack. ⌨ (3:32:03) Check for balanced parentheses using stack ⌨ (3:46:14) Infix, Prefix and Postfix ⌨ (3:59:14) Evaluation of Prefix and Postfix expressions using stack ⌨ (4:14:00) Infix to Postfix using stack ⌨ (4:32:17) Introduction to Queues ⌨ (4:41:35) Array implementation of Queue ⌨ (4:56:33) Linked List implementation of Queue ⌨ (5:10:48) Introduction to Trees ⌨ (5:26:37) Binary Tree ⌨ (5:42:51) Binary Search Tree ⌨ (6:02:17) Binary search tree - Implementation in C/C++ ⌨ (6:20:52) BST implementation - memory allocation in stack and heap ⌨ (6:33:55) Find min and max element in a binary search tree ⌨ (6:39:41) Find height of a binary tree ⌨ (6:46:50) Binary tree traversal - breadth-first and depth-first strategies ⌨ (6:58:43) Binary tree: Level Order Traversal ⌨ (7:10:05) Binary tree traversal: Preorder, Inorder, Postorder ⌨ (7:24:33) Check if a binary tree is binary search tree or not ⌨ (7:41:01) Delete a node from Binary Search Tree ⌨ (7:59:27) Inorder Successor in a binary search tree ⌨ (8:17:23) Introduction to graphs ⌨ (8:34:05) Properties of Graphs ⌨ (8:49:19) Graph Representation part 01 - Edge List ⌨ (9:03:03) Graph Representation part 02 - Adjacency Matrix ⌨ (9:17:46) Graph Representation part 03 - Adjacency List
God Bless you. I went from knowing nothing but arrays to understanding and using six different data structures. This took me a little more than two weeks. I wish you the very best, thank you so much for putting this out for free.
Honestly, these videos are the ones from which I have learned my DS initially. Awesome Videos. FYI single videos exisits instead of this long video, but I think the long format videos would be more useful. Awesome Upload !
@Ambika Jain It has the DS part mainly. Some algorithms are covered but those are data structure specific. One needs to apply the things here along with an Algorithms course to cover dsa .
@razibit 3 months ago Course Contents ⭐ ⌨ (0:00:00) Introduction to data structures ⌨ (0:06:33) Data Structures: List as abstract data type ⌨ (0:19:40) Introduction to linked list ⌨ (0:36:50) Arrays vs Linked Lists ⌨ (0:49:05) Linked List - Implementation in C/C++ ⌨ (1:03:02) Linked List in C/C++ - Inserting a node at beginning ⌨ (1:15:50) Linked List in C/C++ - Insert a node at nth position ⌨ (1:31:04) Linked List in C/C++ - Delete a node at nth position ⌨ (1:43:32) Reverse a linked list - Iterative method ⌨ (1:57:21) Print elements of a linked list in forward and reverse order using recursion ⌨ (2:11:43) Reverse a linked list using recursion ⌨ (2:20:38) Introduction to Doubly Linked List ⌨ (2:27:50) Doubly Linked List - Implementation in C/C++ ⌨ (2:43:09) Introduction to stack ⌨ (2:51:34) Array implementation of stacks ⌨ (3:04:42) Linked List implementation of stacks ⌨ (3:15:39) Reverse a string or linked list using stack. ⌨ (3:32:03) Check for balanced parentheses using stack ⌨ (3:46:14) Infix, Prefix and Postfix ⌨ (3:59:14) Evaluation of Prefix and Postfix expressions using stack ⌨ (4:14:00) Infix to Postfix using stack ⌨ (4:32:17) Introduction to Queues ⌨ (4:41:35) Array implementation of Queue ⌨ (4:56:33) Linked List implementation of Queue ⌨ (5:10:48) Introduction to Trees ⌨ (5:26:37) Binary Tree ⌨ (5:42:51) Binary Search Tree ⌨ (6:02:17) Binary search tree - Implementation in C/C++ ⌨ (6:20:52) BST implementation - memory allocation in stack and heap ⌨ (6:33:55) Find min and max element in a binary search tree ⌨ (6:39:41) Find height of a binary tree ⌨ (6:46:50) Binary tree traversal - breadth-first and depth-first strategies ⌨ (6:58:43) Binary tree: Level Order Traversal ⌨ (7:10:05) Binary tree traversal: Preorder, Inorder, Postorder ⌨ (7:24:33) Check if a binary tree is binary search tree or not ⌨ (7:41:01) Delete a node from Binary Search Tree ⌨ (7:59:27) Inorder Successor in a binary search tree ⌨ (8:17:23) Introduction to graphs ⌨ (8:34:05) Properties of Graphs ⌨ (8:49:19) Graph Representation part 01 - Edge List ⌨ (9:03:03) Graph Representation part 02 - Adjacency Matrix ⌨ (9:17:46) Graph Representation part 03 - Adjacency List@razibit
6:33 Data Structures listed as Data Types 19:45 - 28:00 Linked List 36:53 Array vs Linked List 49:08 - 58:00 Linked List Implementation 1:03:06 - 1:06:31 Linked List: Insert node at the beginning
@Ambika Jain so is it only for basics or any in depth, because it made in 2012 - 2014, and the depth in topics are increased today, is this full course enough to get good in DSA from scratch, and solve problems in today's world
I'm midway to this course and just found out the coder teaching this is no more. My respect to him and his vast knowledge he left behind. He was taken too soon, he would've imparted so much more precious knowledge if he was here. Rest in Peace!
For infix to postfix, those cases concerning brackets, we can also use some recursion-like manipulations to handle this special case. To be specific, if we encounter an opening parenthesis, move the index at the target array forward, and again we call the function itself ( one thing to be noted, we can state static index variables at the start of function). And if we encounter a closing parenthesis, we can pop everything in the stack and return the funciton
It's always great to run into alternate procedures to do a task but personally I prefer the algorithm presented in this video which I believe is basically the Dijkastra yard algorithm. Cuz thinking of brackets as living in the same realm as operators and being placed at the highest ranking is a satisfying way to look at this problem if you come from a maths background.
54:00 Creating new node and Memory Allocation || Traversing via temp = head in order to avoid head loss. 1:07:46 Inserting a node to begining and Updating Head 1:13:12 Global and Local Head differences and necesary function arrangements 1:14:52 Passing head by reference in a function || avoiding assign head in main func 1:19:09 Inserting element by position logic and steps
Just addressing the many comments I've seen under the video... The teacher who is teaching is not dead he is still alive and works at Google his name is Animesh Nayan. Harsha is not the one teaching. But he was involved in the creation of mycodeschool.
I just wanna say this this is one my best youtube ever saw explanatory video on coding all youtubers should be like this begginer to advanced give expalnation not go directly to coding . BEST VIDEO OUT THERE ON DSA .
This is such a quality content. Actually this was uploaded on mycodes school channel of RUclips since some years ago. I will tell those who are new to this course that please watch it full because you will learn a lot from this.
To understand the concept of recursion is to understand what is happening inside the hardware. thanks to the author of this video for explaining it implicitly..finally I have a decent grasp about recursion. unlike other youtubers they explain recursing using somekind of matrix and parallel universe analogy. its all about the hardware thats why I feel understanding c and c++ especially c, will make me the best programmer that I can be.
mycodeschool is a legend in programming videos. But 😢 sad that one of the channel owners died long back due to accident. I think their channel is inactive because of this reason.
@@rajaryaman6495 @Mohit Motwani Its been all over quora and other platforms... Topcoder named their contest in tribute to him.... its Harsha Suryanarayan... Anyway, he died in road accident while returning home with his wife... his wife was critical but he died on the spot... its really tragic... Harsha was the first among us.... the very best.... our guru and father of cp for Indians. Our humblefool. RIP.
@@Ankit-mq6em Yaa he is the highest rated indian on topcoder and won many competitions includes algorithm, design, development category 45 out of 81. He is a legend
@@iitnakanpur.. I studied from his video in 2017 in my college and made notes also ,I was thinking that he is busy in his business so he is not making videos on RUclips,but now I came to know that he is no more from 2014 ,really painful
At 2:15:51 , 'p' should be pointing to 'head' at the start of the Reverse function, i.e. >>......... void Reverse(struct Node* p){ p = head; if(p->next == NULL)...........}
@mycodeschool one the best programming channels on the planet to learn foundations of programming. Hats off to Animesh Nayan and Harsha for their Hardwork they put in to teach students CS Foundations.
47:26 the way I implemented a linked list adding an element at the end had a time complexity of O(1) aswell. I had a pointer (like head) called tail that constantly pointed at the end of the linked list so every time I inserted a new node I didn't have to traverse I just created a new node and would dereference the tail pointer and assign the "next" property to the newly allocated memory address of the new node. So it was much faster.
Algorithms shouldn't be a problem once you know data structures in a certain language. Algorithms are less about the pragmatics and are more of a general concept.
Most awaited course. I didn't watch it but I will. Usually RUclips has a lot of content but they all are too old. Hope it will be updated version of DS
![Pointers in C / C++ [Full Course]](http://i.ytimg.com/vi/zuegQmMdy8M/mqdefault.jpg)
It took me about 2 and a half weeks to complete this video. Along with understanding the theory behind these data structures, I also got a firm handle on their implementation in C++. I feel very comfortable going into my actual Data Structures course in university, having studied this video. I thank the maker of this video for allowing me to view it for free. I wish I could like it more than once. A thousand thank you's.
What prior experinece did you have and how was the flow?
@@nijagunadarshan2529 I took a C course in university and it was a disaster. So over the summer I decided to fill in my knowledge gaps. I started with this video, however i soon realized I need to watch the freeCodeCamp video on C/C++ pointers. So i watched and studied that video and then circled back to this video. Prior to these video I had no experience. The flow was very organized and constructive
same I'm trying to complete this video before my spring semester during winter break, so far the video is super helpful
@@bluewaveonthewaysidebythepier I would also seriously suggest actually typing out the code multiple times. These data structures are pretty standard and if you can quickly construct them in code youll struggle less with implementing them on your assignments
@@paulwolak6557 i am also trying this, i will start this from today, hope to complete it within this week. i also did that pointer video, it was really very helpful for me.
This legend died when I was in 7th standard, and now I am learning DSA from his lectures in 1st year of my college.
Your soul is still alive sir, and you are still a great contributor to the coding community.
The person teaching this did not die. Only his friend who helped him died, the person teaching is still alive.
@@rohithdsouza8 who is the person who is teaching?
@@batuhanyldrm6913 animesh sir ....i guess
@@manistrikes yeah he works at google
but the video is a year old...
Whoever you are, God bless you. You have done service to those who can't afford to learn in an institute. Because of you someone will have bread on their table. Gratitude to mother who birthed you.
humanity still exists on this earth!
I heard he's dead
@@gregh5061 You serious?
@@Jaogurich died in 2015. rip.
@@Jaogurich harsha, yes, he is no more, it sinks my heart when I say this because I looked up to him, a true gem of a programmer
Animesh and Harsha recorded these videos back in 2012, they knew we would need them in the future. Absolute Legends !!!
you are talking like they are the only one who thought of making courses back then
@@chandranshpandey1929 No one made such quality content back then specially from india.
@@chandranshpandey1929 many thought of making maybe, they made it.. there's a difference. OGs
Most people don't know that this teacher died in an accident about 6 years ago. Very good teacher, a very good competitive programmer RIP
If the teacher is died . Than who is teaching in this video?
@@pandasworld4168 In actuality, I did not know that today I have seen the channel for the first time
he will be remebered by us fellow programmers
And teacher name is Harsha Suryanarayana . He was God of coding community.
Bro this is from Mycode school whose founder is Animesh Nayan and not humblefool(Harsha Suryanarayan)
Harsha died in road accident and not Animesh
One of best teacher i ever seen throughout my life ...literally no one can teach like him...He teaches every single from basic to high advanced level...And one of the best thing is that he teach us where we can make mistake and how solve it with full explanation....hats off to such amazing teacher... Thank you so so much...
this comment has to be pinned
Harsha Suryanarayana was a legend and the best competitive coder to come out of India. His works didn't go in vain, he still live for next 100 years due his knowledge sharing. Rest in Peace my teacher :)
what happened to him
R.I.P Suryanarayana, sir.
@@deepakjose9889 Vehicular manslaughter of a pedestrian.
The pedestrian being the honoured in question and his faithful spouse.
@@deepakjose9889 In 2014, he was hit by a speeding car which resulted in his sad demise. RIP
is this his video like is he the one who's teaching?
1:39:00 there was no need of an exceptional case for n=1 , just a change was required in the test condition of for loop (inext;
free(temp2);
This tutorial is OMG!!!! One of the best CS Tutorials on youtube, let alone in DSA. If anyone is having second thoughts about watching this one, lemme assure you, this is hands down the best one in DSA.
Kudos to the great duo of Animesh Sir and Harsha Sir (rip).
Cleared my interviews in 2015 using this series.
thank you Harsha for giving many students this quality content may your soul rest in peace
heartfelt tribute to Lord Harsha. May his name and memories continue to inspire Indians across the globe to strive for excellence while being humble at the same time
Salute you sir, for this huge amount of work you have put in. Whether you are in Heaven or Earth, may you and your family be blessed always. I have an interview tomorrow. I don't know how it will go as I am from mechanical background, but I really love programming and data science. Whatever be the result of the interview, I will always be thankful for this video.
Been watching this since 2017 when I was first year on college now I am senior full stack developer this helps me a lot achieving my goal.
How is the actual job vs the schooling?
I am 1st year..do i should this video?
@@sohagpage7482 Yes! The earlier the better. School won’t teach you until your 3rd/4th year, while the internet can teach you right now and you’ll be ahead of your peers
I was about to comment that how helpful this video is and I really wanted to thank the maker to make it available for free. But I read some comments about his death and if it is really true, this breaks my heart that the world lost such a great teacher. The way he is teaching in the videos is exemplary. May his soul rests in peace and I hope more and more students find this video. Thankyou very much sir, wherever you are.
It's Animesh Nayan sir teaching in these videos and he's alive and kicking. He's currently working at Google.
ecie to track progress step by step as encouragement (previous steps have been deleted because I edited):
progress: 5:11:00
progress 7/26: 6:04:34
progress 7/27: 7:25:00
progress 7/29: 7:42:00
progress 7/30: 8:17:53 (finished trees wish there was more on general trees rather than just BST and how to turn a normal tree into a BST)
progress 7/31: FINISHED
🔥🔥🔥
Day 1:
52:02
1:43:32
Day 2:
1:58:11
2:11:47
2:21:20
Day 3:
2:43:20
3:15:50
Day 4:
4:32:36
Day 5: 5:11:08
Day 8:
6:20:52
7:00:43
8:18:02
Thnx buddy
Thankyou Mycodeschool and freecodecamp
Probably the disliked people are collage lecturers who envied his teaching skills
Thanks!
I love the instructor(s) at mycodeschool. Dude(s) has such raw ability to explain difficult concepts.
just in time to get a head start before i resume my computer science degree
Thanks guys, this is just perfect cause I've been trying to understand C and C++ in-depth coming from a web dev background using PHP, Python, JS and such.
Nice bro
funny, im trying to learn web dev, ive used C, C++,Java and C# , but ive never touched python, javascript or html. I only did a little CSS because the GUI's i made in C++ and Java most of them used stylesheets
you guys are amazing. This is like the best youtube channel to learn. I have never seen anything like this channel. It's short, concise and straight to the point
Love MyCodeSchool. I stand on their shoulders 💚. That's where I started.
im so so so so sad to hear this man passed away. This video is helping me so much in my life. Thank God for sending us a great teacher :(
Only legends know that this content has been on RUclips from 5-6 years.
Doesn’t really matter if you never actually watched /took notes on anything, and subsequently got a job from doing so.
Yes, I know. These videos existed a long time back. Awesome videos.
Yes I remember now..
Yeah, bro had it for years 👍
Clges mei b jo books chlti h vo toh 15-20 saal purani hoti h😂😂
Damn these videos are old but the quality !!
I am sure even after 5 years or so, These will still be the best !
Course Contents ⭐
⌨ (0:00:00) Introduction to data structures
⌨ (0:06:33) Data Structures: List as abstract data type
⌨ (0:19:40) Introduction to linked list
⌨ (0:36:50) Arrays vs Linked Lists
⌨ (0:49:05) Linked List - Implementation in C/C++
⌨ (1:03:02) Linked List in C/C++ - Inserting a node at beginning
⌨ (1:15:50) Linked List in C/C++ - Insert a node at nth position
⌨ (1:31:04) Linked List in C/C++ - Delete a node at nth position
⌨ (1:43:32) Reverse a linked list - Iterative method
⌨ (1:57:21) Print elements of a linked list in forward and reverse order using recursion
⌨ (2:11:43) Reverse a linked list using recursion
⌨ (2:20:38) Introduction to Doubly Linked List
⌨ (2:27:50) Doubly Linked List - Implementation in C/C++
⌨ (2:43:09) Introduction to stack
⌨ (2:51:34) Array implementation of stacks
⌨ (3:04:42) Linked List implementation of stacks
⌨ (3:15:39) Reverse a string or linked list using stack.
⌨ (3:32:03) Check for balanced parentheses using stack
⌨ (3:46:14) Infix, Prefix and Postfix
⌨ (3:59:14) Evaluation of Prefix and Postfix expressions using stack
⌨ (4:14:00) Infix to Postfix using stack
⌨ (4:32:17) Introduction to Queues
⌨ (4:41:35) Array implementation of Queue
⌨ (4:56:33) Linked List implementation of Queue
⌨ (5:10:48) Introduction to Trees
⌨ (5:26:37) Binary Tree
⌨ (5:42:51) Binary Search Tree
⌨ (6:02:17) Binary search tree - Implementation in C/C++
⌨ (6:20:52) BST implementation - memory allocation in stack and heap
⌨ (6:33:55) Find min and max element in a binary search tree
⌨ (6:39:41) Find height of a binary tree
⌨ (6:46:50) Binary tree traversal - breadth-first and depth-first strategies
⌨ (6:58:43) Binary tree: Level Order Traversal
⌨ (7:10:05) Binary tree traversal: Preorder, Inorder, Postorder
⌨ (7:24:33) Check if a binary tree is binary search tree or not
⌨ (7:41:01) Delete a node from Binary Search Tree
⌨ (7:59:27) Inorder Successor in a binary search tree
⌨ (8:17:23) Introduction to graphs
⌨ (8:34:05) Properties of Graphs
⌨ (8:49:19) Graph Representation part 01 - Edge List
⌨ (9:03:03) Graph Representation part 02 - Adjacency Matrix
⌨ (9:17:46) Graph Representation part 03 - Adjacency List
Before commenting I just read one comment that you are not with us .and I shocked 😱🤯 rest in peace.
Thank you so much for sharing knowledge. Before watching this video. I was scary about DS but now I get lot of confidence on this topic. That is only because of you. That voice make me more interesting. But we miss you.
I was halfway through your other data structures youtube video, using it for ç++ until you posted this, can't wait to move into this, always amazing content
⭐ Course Contents ⭐
⌨ (0:00:00) Introduction to data structures
⌨ (0:06:33) Data Structures: List as abstract data type
⌨ (0:19:40) Introduction to linked list
⌨ (0:36:50) Arrays vs Linked Lists
⌨ (0:49:05) Linked List - Implementation in C/C++
⌨ (1:03:02) Linked List in C/C++ - Inserting a node at beginning
⌨ (1:15:50) Linked List in C/C++ - Insert a node at nth position
⌨ (1:31:04) Linked List in C/C++ - Delete a node at nth position
⌨ (1:43:32) Reverse a linked list - Iterative method
⌨ (1:57:21) Print elements of a linked list in forward and reverse order using recursion
⌨ (2:11:43) Reverse a linked list using recursion
⌨ (2:20:38) Introduction to Doubly Linked List
⌨ (2:27:50) Doubly Linked List - Implementation in C/C++
⌨ (2:43:09) Introduction to stack
⌨ (2:51:34) Array implementation of stacks
⌨ (3:04:42) Linked List implementation of stacks
⌨ (3:15:39) Reverse a string or linked list using stack.
⌨ (3:32:03) Check for balanced parentheses using stack
⌨ (3:46:14) Infix, Prefix and Postfix
⌨ (3:59:14) Evaluation of Prefix and Postfix expressions using stack
⌨ (4:14:00) Infix to Postfix using stack
⌨ (4:32:17) Introduction to Queues
⌨ (4:41:35) Array implementation of Queue
⌨ (4:56:33) Linked List implementation of Queue
⌨ (5:10:48) Introduction to Trees
⌨ (5:26:37) Binary Tree
⌨ (5:42:51) Binary Search Tree
⌨ (6:02:17) Binary search tree - Implementation in C/C++
⌨ (6:20:52) BST implementation - memory allocation in stack and heap
⌨ (6:33:55) Find min and max element in a binary search tree
⌨ (6:39:41) Find height of a binary tree
⌨ (6:46:50) Binary tree traversal - breadth-first and depth-first strategies
⌨ (6:58:43) Binary tree: Level Order Traversal
⌨ (7:10:05) Binary tree traversal: Preorder, Inorder, Postorder
⌨ (7:24:33) Check if a binary tree is binary search tree or not
⌨ (7:41:01) Delete a node from Binary Search Tree
⌨ (7:59:27) Inorder Successor in a binary search tree
⌨ (8:17:23) Introduction to graphs
⌨ (8:34:05) Properties of Graphs
⌨ (8:49:19) Graph Representation part 01 - Edge List
⌨ (9:03:03) Graph Representation part 02 - Adjacency Matrix
⌨ (9:17:46) Graph Representation part 03 - Adjacency List
looking up from the video description itself is easier than from comments, but thanks anyway ig
Thanks a lot
where is sorting?
Mycodeschool subscribers are like- ok i know this 😂
yes brother :)
True
Exactly lmao🤣
bottom left it is mentioned
Why it doesn't get copyright ?? ... Anyone explain ?
@@bhupeshpattanaik7150 freecodecamp collab with other RUclipsrs to get these videos
God Bless you. I went from knowing nothing but arrays to understanding and using six different data structures. This took me a little more than two weeks. I wish you the very best, thank you so much for putting this out for free.
The most legendary video and teacher. Dead ass saved my grade in 9 hours. Op
Honestly, these videos are the ones from which I have learned my DS initially. Awesome Videos. FYI single videos exisits instead of this long video, but I think the long format videos would be more useful. Awesome Upload !
@Ambika Jain It has the DS part mainly. Some algorithms are covered but those are data structure specific. One needs to apply the things here along with an Algorithms course to cover dsa .
Im only an hour in and have learned more than what i have learned in a comp sci college course
I took one week to learn what my college couldn't in 6 damn months
@razibit
3 months ago
Course Contents ⭐
⌨ (0:00:00) Introduction to data structures
⌨ (0:06:33) Data Structures: List as abstract data type
⌨ (0:19:40) Introduction to linked list
⌨ (0:36:50) Arrays vs Linked Lists
⌨ (0:49:05) Linked List - Implementation in C/C++
⌨ (1:03:02) Linked List in C/C++ - Inserting a node at beginning
⌨ (1:15:50) Linked List in C/C++ - Insert a node at nth position
⌨ (1:31:04) Linked List in C/C++ - Delete a node at nth position
⌨ (1:43:32) Reverse a linked list - Iterative method
⌨ (1:57:21) Print elements of a linked list in forward and reverse order using recursion
⌨ (2:11:43) Reverse a linked list using recursion
⌨ (2:20:38) Introduction to Doubly Linked List
⌨ (2:27:50) Doubly Linked List - Implementation in C/C++
⌨ (2:43:09) Introduction to stack
⌨ (2:51:34) Array implementation of stacks
⌨ (3:04:42) Linked List implementation of stacks
⌨ (3:15:39) Reverse a string or linked list using stack.
⌨ (3:32:03) Check for balanced parentheses using stack
⌨ (3:46:14) Infix, Prefix and Postfix
⌨ (3:59:14) Evaluation of Prefix and Postfix expressions using stack
⌨ (4:14:00) Infix to Postfix using stack
⌨ (4:32:17) Introduction to Queues
⌨ (4:41:35) Array implementation of Queue
⌨ (4:56:33) Linked List implementation of Queue
⌨ (5:10:48) Introduction to Trees
⌨ (5:26:37) Binary Tree
⌨ (5:42:51) Binary Search Tree
⌨ (6:02:17) Binary search tree - Implementation in C/C++
⌨ (6:20:52) BST implementation - memory allocation in stack and heap
⌨ (6:33:55) Find min and max element in a binary search tree
⌨ (6:39:41) Find height of a binary tree
⌨ (6:46:50) Binary tree traversal - breadth-first and depth-first strategies
⌨ (6:58:43) Binary tree: Level Order Traversal
⌨ (7:10:05) Binary tree traversal: Preorder, Inorder, Postorder
⌨ (7:24:33) Check if a binary tree is binary search tree or not
⌨ (7:41:01) Delete a node from Binary Search Tree
⌨ (7:59:27) Inorder Successor in a binary search tree
⌨ (8:17:23) Introduction to graphs
⌨ (8:34:05) Properties of Graphs
⌨ (8:49:19) Graph Representation part 01 - Edge List
⌨ (9:03:03) Graph Representation part 02 - Adjacency Matrix
⌨ (9:17:46) Graph Representation part 03 - Adjacency List@razibit
Pin this
Legends know the story behind these videos !! Humblefool 💚
What is the story ?
6:33 Data Structures listed as Data Types
19:45 - 28:00 Linked List
36:53 Array vs Linked List
49:08 - 58:00 Linked List Implementation
1:03:06 - 1:06:31 Linked List: Insert node at the beginning
cmon george finish the course
I used this to help me with my data structures home work some time back. Good stuff!
@Ambika Jain did you got the anwer
@Ambika Jain so is it only for basics or any in depth, because it made in 2012 - 2014, and the depth in topics are increased today, is this full course enough to get good in DSA from scratch, and solve problems in today's world
Progress:
--> 36:50
--> 1:15:50
--> 1:43:38
--> 1:57:27
--> 2:20:45
--> 2:43:22
--> 2:51:44
--> 3:15:50
--> 3:46:27
--> 4:14:14
--> 4:41:35
--> 4:56:33
RESPECT ANIMESH AND HUMBLEFOOL
thanks haha
@@animeshshah9913 fake?
this is my whole 2nd year of DSA, thank you very much for this!
Your legacy will remain forever, i landed an amazing job , and this course played a major role ... RIP , you are always alive inform of knowledge 🙏
I'm midway to this course and just found out the coder teaching this is no more. My respect to him and his vast knowledge he left behind. He was taken too soon, he would've imparted so much more precious knowledge if he was here. Rest in Peace!
For infix to postfix, those cases concerning brackets, we can also use some recursion-like manipulations to handle this special case. To be specific, if we encounter an opening parenthesis, move the index at the target array forward, and again we call the function itself ( one thing to be noted, we can state static index variables at the start of function). And if we encounter a closing parenthesis, we can pop everything in the stack and return the funciton
It's always great to run into alternate procedures to do a task but personally I prefer the algorithm presented in this video which I believe is basically the Dijkastra yard algorithm. Cuz thinking of brackets as living in the same realm as operators and being placed at the highest ranking is a satisfying way to look at this problem if you come from a maths background.
my code school is the best programming channel i have seen .
Best data structure course on youtube
:)
54:00 Creating new node and Memory Allocation || Traversing via temp = head in order to avoid head loss.
1:07:46 Inserting a node to begining and Updating Head
1:13:12 Global and Local Head differences and necesary function arrangements
1:14:52 Passing head by reference in a function || avoiding assign head in main func
1:19:09 Inserting element by position logic and steps
Just addressing the many comments I've seen under the video...
The teacher who is teaching is not dead he is still alive and works at Google his name is Animesh Nayan.
Harsha is not the one teaching. But he was involved in the creation of mycodeschool.
I just wanna say this this is one my best youtube ever saw explanatory video on coding all youtubers should be like this begginer to advanced give expalnation not go directly to coding . BEST VIDEO OUT THERE ON DSA .
This is such a quality content.
Actually this was uploaded on mycodes school channel of RUclips since some years ago.
I will tell those who are new to this course that please watch it full because you will learn a lot from this.
Too good. Explanation is clear. Examples are relatable. Line by line explanation of code is of great value.
Examples in this are so good. All are related to real-world implementation and help to understand Data structure more clearly. Thanks for this.
1:26:00 Functioning of Heap, Stack etc during a code run
2:02:00 Printing values of LinkedList in reverse USING RECURSION
Thank you very much for such a valuable lesson! These 'animations' really help to understand everything better.
Best course ever for data structure ,If anyone wanna learn Data structure then start with this
When you watch the video at 2x speed to save time but it is still O(n) :/
Lol
What does it mean?
@@vyasnikhil9037 we have to traverse whole section that is n
😂
When I made it 2x, I thought it was Hindi language
the best data structures course available!!!.....
To understand the concept of recursion is to understand what is happening inside the hardware. thanks to the author of this video for explaining it implicitly..finally I have a decent grasp about recursion. unlike other youtubers they explain recursing using somekind of matrix and parallel universe analogy. its all about the hardware thats why I feel understanding c and c++ especially c, will make me the best programmer that I can be.
I have learnt data structures from my code school, its the best stuff you can get
Excellent teaching, seriously loved the style of explaination and the content delivered. Thanks a lot for these videos. !!
R.I.P my teacher Harsha Suryanarayana. I am learning so much from your videos. Thanks to you, I'm still resisting on my programming learning journey!
mycodeschool is a legend in programming videos. But 😢 sad that one of the channel owners died long back due to accident. I think their channel is inactive because of this reason.
True. I also know about this story
Same i heard
@@exodus5948 What story? Can you please tell me? who died in accident?
@@rajaryaman6495 Humblefool died in an accident :(
@@rajaryaman6495 @Mohit Motwani Its been all over quora and other platforms... Topcoder named their contest in tribute to him.... its Harsha Suryanarayan... Anyway, he died in road accident while returning home with his wife... his wife was critical but he died on the spot... its really tragic... Harsha was the first among us.... the very best.... our guru and father of cp for Indians. Our humblefool. RIP.
Getting ready for the exam!
Thanks for this awesome content!
I am so grateful for such course. you were so talented at making daunting things look abstract and easy to grasp... may your soul rest in peace legend
I highly recommend this course , it help me a lot after Allah in having a deep understanding of data structures.
easy to follow along course. We just started Data Structures at my University.This is really going to be helpful for me in the near future.
it would be great idea to add captions so that non-English people can also get benefit from this course
Thank you My friend for this Video because of you I passed my Data Structures exam hope it makes you smile up there, RIP
9 hours of KDrama ❌❌
9 hours of Data structure ✔✔
9 hours of KDrama completed in 9 hours
but 9 hours of DS atleast takes atleast 12+ hours
Literally Best Data Structures Course Ever!
The instructor of this video, Harsha (Humblefool) was legendary coder India has ever produced. But he is no more 😞
What was her rating on codeforces?
Really
@@Ankit-mq6em Yaa he is the highest rated indian on topcoder and won many competitions includes algorithm, design, development category 45 out of 81. He is a legend
how old was he?
@@iitnakanpur.. I studied from his video in 2017 in my college and made notes also ,I was thinking that he is busy in his business so he is not making videos on RUclips,but now I came to know that he is no more from 2014 ,really painful
1:20:00 Linkedlist(
1:42:00 temp-> points next node
42:50 it should be 20 bytes because every node has (4+4) bytes but the last node has [data + null pointer]= (4+0) so , [4+4]+[4+4]+[4+0]=20
Null Pointer also takes space
Very good tutorial, I'm watching this from Zimbabwe.
God bless you and rest in peace master, you've fulfilled a lot of knowledge holes in prog that is saving a lot of student lives, thank you sr!!
At 2:15:51 , 'p' should be pointing to 'head' at the start of the Reverse function, i.e.
>>......... void Reverse(struct Node* p){ p = head; if(p->next == NULL)...........}
Very neat and concise explanation !!!
Video OP for the last 5 years. 🔥🔥🔥
I am sure, no one can replace him in this era.
This is my second time watching this complete video.
🙏🙏🙏🙏🙏
Great teacher and great explanation!
Please, can you make other courses about C++ STL and std?
he is dead already , this video is 5-6 years old from his friends youtube channel
i appreciate how easy your english is to understand
Best video for data structures I ever had. Perfect animations with perfect timing. Thank you soo much bro, May Allah bless you with success!
check point: 1:25:42
check point : 2:43:27
🥺Very very Thanks..i am really waiting for this...can you guys make a Competitive Programming C++ full beginner-advance cource ..plz plz plz
@mycodeschool one the best programming channels on the planet to learn foundations of programming. Hats off to Animesh Nayan and Harsha for their Hardwork they put in to teach students CS Foundations.
47:26 the way I implemented a linked list adding an element at the end had a time complexity of O(1) aswell. I had a pointer (like head) called tail that constantly pointed at the end of the linked list so every time I inserted a new node I didn't have to traverse I just created a new node and would dereference the tail pointer and assign the "next" property to the newly allocated memory address of the new node. So it was much faster.
What an awesome instructor! May God bless you...
he is no more
Pls upload algorithms with c/c++ too🙏
Algorithms shouldn't be a problem once you know data structures in a certain language. Algorithms are less about the pragmatics and are more of a general concept.
@@gregh5061 after this playlist whole of dsa would be completed then?
@@tanvisaxena422 i guess.
bhai yarr... too good hai yrrr... really really grateful...
Today is the day when I finally completed this entire lecture
So proud of myself 🎉
ruclips.net/video/YNs7nfovi-w/видео.html👍👍🙂🙂
👏👏👏
Most awaited course. I didn't watch it but I will. Usually RUclips has a lot of content but they all are too old. Hope it will be updated version of DS
You rock! you rock! Free code camp! Thanks for this awesome course mycode school needed this a lot. 😊
best course for data structures on youtube !! thankyou so much sir
Everyone studying from sucky useless Data structures professor in Indian colleges knows that this is the best playlist on DS
Even the future generation will be grateful for this masterpiece. Harsha Suryanarayana was a gem 💎...
Bring in Algorithms in C++
I guess mycodeschool does not have videos on algos
@@mradulagrawal5876 yeah. It was directed towards freecodecamp
@@jawwadsiddique1729 oh ok 👍🏻
1:31:11
1:43:40
3:32:16
4:11:35
4:52:06
6:23:07
7:10:32
8:06:56
8:40:08
9:18:21 W3
I gasped for a moment... Then realize that this is his old channel videos