Data Structures - Full Course Using C and C++

[@paulwolak6557]

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]

What prior experinece did you have and how was the flow?

[@paulwolak6557]

@@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]

same I'm trying to complete this video before my spring semester during winter break, so far the video is super helpful

[@paulwolak6557]

@@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

[@giveaway4002]

@@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.

[@ProfRavenSteel]

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.

[@shivShaktitech]

humanity still exists on this earth!

[@gregh5061]

I heard he's dead

[@Jaogurich]

@@gregh5061 You serious?

[@gregh5061]

@@Jaogurich died in 2015. rip.

[@adityavsx]

@@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

[@Bruhhn]

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);

[@rohanchattopadhayaya8779]

@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

[@mushraff-qi9ru]

Pin this

[@kenseifeitan4663]

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.

[@andiuptown1711]

How is the actual job vs the schooling?

[@sohagpage7482]

I am 1st year..do i should this video?

[@andiuptown1711]

@@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

[@rakeshchavan8585]

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...

[@teluguchannel8849]

this comment has to be pinned

[@naineshrathod2392]

Animesh and Harsha recorded these videos back in 2012, they knew we would need them in the future. Absolute Legends !!!

[@chandranshpandey1929]

you are talking like they are the only one who thought of making courses back then

[@sriram8027]

@@chandranshpandey1929 No one made such quality content back then specially from india.

[@trueresources3847]

@@chandranshpandey1929 many thought of making maybe, they made it.. there's a difference. OGs

[@kamalsingh1345]

⭐ 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

[@Yilmaz4]

looking up from the video description itself is easier than from comments, but thanks anyway ig

[@depp108]

Thanks a lot

[@nidhisharma-eh3cp]

where is sorting?

[@pandasworld4168]

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

[@neerukasaniaparjapati7896]

If the teacher is died . Than who is teaching in this video?

[@neerukasaniaparjapati7896]

@@pandasworld4168 In actuality, I did not know that today I have seen the channel for the first time

[@sedelonx5138]

he will be remebered by us fellow programmers

[@rajpatel327]

And teacher name is Harsha Suryanarayana . He was God of coding community.

[@shivanshpandey2834]

Bro this is from Mycode school whose founder is Animesh Nayan and not humblefool(Harsha Suryanarayan) Harsha died in road accident and not Animesh

[@avinier325]

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).

[@razibit]

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

[@adityaparmar5627]

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.

[@rohithdsouza8]

The person teaching this did not die. Only his friend who helped him died, the person teaching is still alive.

[@batuhanyldrm6913]

@@rohithdsouza8 who is the person who is teaching?

[@manistrikes]

@@batuhanyldrm6913 animesh sir ....i guess

[@tejasaditya551]

@@manistrikes yeah he works at google

[@siddharthbhandari6310]

but the video is a year old...

[@ajinkyax]

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 :)

[@deepakjose9889]

what happened to him

[@JJDvorshak]

R.I.P Suryanarayana, sir.

[@JJDvorshak]

@@deepakjose9889 Vehicular manslaughter of a pedestrian. The pedestrian being the honoured in question and his faithful spouse.

[@uusoft]

​@@deepakjose9889 In 2014, he was hit by a speeding car which resulted in his sad demise. RIP

[@srikarchatla5178]

is this his video like is he the one who's teaching?

[@HaLyGjQdTpReMnKmW2X]

Thanks!

[@simrandotdev]

Cleared my interviews in 2015 using this series.

[@oximas-oe9vf]

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 🔥🔥🔥

[@anandcherian.585]

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.

[@adityashrivastava7074]

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.

[@kshitiz6376]

It's Animesh Nayan sir teaching in these videos and he's alive and kicking. He's currently working at Google.

[@satyabratsrikumar]

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

[@pixelated-loser]

thank you Harsha for giving many students this quality content may your soul rest in peace

[@atraps7882]

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.

[@codex8797]

Nice bro

[@IonizedComa]

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

[@mohitmotwani9256]

Only legends know that this content has been on KZbin from 5-6 years.

[@jordough4495]

Doesn’t really matter if you never actually watched /took notes on anything, and subsequently got a job from doing so.

[@sumitlahiri4973]

Yes, I know. These videos existed a long time back. Awesome videos.

[@lalomega7966]

Yes I remember now..

[@charlieburberry5681]

Yeah, bro had it for years 👍

[@mridulbagla]

Clges mei b jo books chlti h vo toh 15-20 saal purani hoti h😂😂

[@trakra9959]

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.

[@georgegray5825]

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

[@elicubillo313]

cmon george finish the course

[@WorksDontSave]

just in time to get a head start before i resume my computer science degree

[@serdasimus7534]

I love the instructor(s) at mycodeschool. Dude(s) has such raw ability to explain difficult concepts.

[@prakash_77]

Love MyCodeSchool. I stand on their shoulders 💚. That's where I started.

[@Wilson2746]

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

[@ayushtripathi4225]

Thnx buddy

[@salihozdemr]

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

[@peterackerman9908]

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

[@dattatammisetti9324]

Thankyou Mycodeschool and freecodecamp Probably the disliked people are collage lecturers who envied his teaching skills

[@djlivestreem4039]

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 :(

[@revathinagireddi64]

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.

[@reyrivera8002]

The most legendary video and teacher. Dead ass saved my grade in 9 hours. Op

[@unfazed7495]

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

[@samuraijosh1595]

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.

[@koustavbanerjee8195]

Damn these videos are old but the quality !! I am sure even after 5 years or so, These will still be the best !

[@sushantmore6492]

Mycodeschool subscribers are like- ok i know this 😂

[@anubhavkumarrao3141]

yes brother :) True

[@subhankarpal_cs2a_697]

Exactly lmao🤣

[@Vikram123654]

bottom left it is mentioned

[@bhupeshpattanaik7150]

Why it doesn't get copyright ?? ... Anyone explain ?

[@ri8176]

@@bhupeshpattanaik7150 freecodecamp collab with other KZbinrs to get these videos

[@DarkShadow-ss2fl]

When you watch the video at 2x speed to save time but it is still O(n) :/

[@harsh9558]

Lol

[@vyasnikhil9037]

What does it mean?

[@alokgoldy9219]

@@vyasnikhil9037 we have to traverse whole section that is n

[@anantsaini]

😂

[@eren1514]

When I made it 2x, I thought it was Hindi language

[@glenn8459]

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

[@PrinceSharma-jg2mh]

RESPECT ANIMESH AND HUMBLEFOOL

[@animeshshah9913]

thanks haha

[@cutiepielonely]

@@animeshshah9913 fake?

[@momosbiryani]

at 5:09:04 if (front==rear), it means there is one node(and the only node) in the Linked list queue, so while deQueueing we set front=null and rear=null but don't we also need to delete that node, like how you did for the next case.

[@sumitlahiri4973]

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 !

[@sumitlahiri4973]

@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 .

[@deco-der]

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 .

[@simon-gh1pt]

Best data structure course on youtube :)

[@ananyabhagat7052]

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!

[@joemartinez6194]

I used this to help me with my data structures home work some time back. Good stuff!

[@dudamneerajdattu1459]

@Ambika Jain did you got the anwer

[@dudamneerajdattu1459]

@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

[@anshulrevuru4289]

Too good. Explanation is clear. Examples are relatable. Line by line explanation of code is of great value.

[@ompatel4990]

Im only an hour in and have learned more than what i have learned in a comp sci college course

[@sra9an938]

I took one week to learn what my college couldn't in 6 damn months

[@sridhar2519]

Here I will be sharing my learning journey by updating each session... In case, if I discontinue this due to procrastintion , please comment to remind me Session 1: 45:27

[@rhythmgupta3421]

Bhai continue

[@sridhar2519]

🥺Thankyou so much bhai@@rhythmgupta3421

[@kaistacks]

@@sridhar2519 bhai phirse bhul gya

[@kobebriansantos5558]

this is my whole 2nd year of DSA, thank you very much for this!

[@rahulyavvari]

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)...........}

[@PraddyumnShukla]

Legends know the story behind these videos !! Humblefool 💚

[@ifhamkhwaja7542]

What is the story ?

[@pendyalaabhishek8866]

my code school is the best programming channel i have seen .

[@codderboy9898]

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

[@anshuman6623]

Null Pointer also takes space

[@mr_anonymous123]

@1:37:00 , temp1 points to nth node as n iterations of the for loop happen

[@suhaillone831]

This is such a quality content. Actually this was uploaded on mycodes school channel of KZbin 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.

[@mohit7717]

Best course ever for data structure ,If anyone wanna learn Data structure then start with this

[@akhilbisht798]

Examples in this are so good. All are related to real-world implementation and help to understand Data structure more clearly. Thanks for this.

[@RatioBozo69]

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

[@mertile1dakika]

Thank you very much for such a valuable lesson! These 'animations' really help to understand everything better.

[@ee-a066swagatchowdhury2]

the best data structures course available!!!.....

[@blasttrash]

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.

[@exodus5948]

True. I also know about this story

[@Sunil_13_7]

Same i heard

[@rajaryaman6495]

@@exodus5948 What story? Can you please tell me? who died in accident?

[@srajesh2166]

@@rajaryaman6495 Humblefool died in an accident :(

[@etpaprika]

@@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.

[@muke4937]

@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.

[@surajmenon9207]

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 🙏

[@SphereofTime]

1:20:00 Linkedlist( 1:42:00 temp-> points next node

[@ecengclub7196]

9 hours of KDrama ❌❌ 9 hours of Data structure ✔✔

[@krronotic2448]

9 hours of KDrama completed in 9 hours but 9 hours of DS atleast takes atleast 12+ hours

[@muhammadnabeedhaider4926]

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.

[@ibrahimgallegoliwanag1756]

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.

[@LAMG059]

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

[@jvmadhav1987]

The instructor of this video, Harsha (Humblefool) was legendary coder India has ever produced. But he is no more 😞

[@iitnakanpur..]

What was her rating on codeforces?

[@Ankit-mq6em]

Really

[@iitnakanpur..]

@@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

[@mdanamulhossain8954]

how old was he?

[@Ankit-mq6em]

@@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 KZbin,but now I came to know that he is no more from 2014 ,really painful

[@RanjanKumar-bu7ws]

I have learnt data structures from my code school, its the best stuff you can get

[@adityaanuragi6916]

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.

[@ahmed__nawara]

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

[@niteshnareshnarwade321]

//Implementation of BST by loops (not by the recursuion) #include using namespace std; typedef vector vec; #define PB push_back class BstNode{ public: int data; BstNode* left; BstNode* right; }; BstNode* root = NULL; void Insert(int data) { BstNode* temp1 = new BstNode(); temp1 ->data = data; temp1 ->left = NULL; temp1 ->right = NULL; BstNode* temp2 = root; if(root==NULL) { root = temp1; temp2 = temp1; } else if(temp1 ->data data) { //temp2 ->left = temp1; while(temp2 ->left!=NULL) { temp2 = temp2 ->left; } if(temp1 ->data data) { temp2 ->left = temp1; } else { temp2 ->right = temp1; } } else { //temp2 ->right = temp1; while(temp2 ->right!=NULL) { temp2 = temp2 ->right; } if(temp1 ->data > temp2 ->data) { temp2 ->right = temp1; } else { temp2 ->left = temp1; } } } bool Search(int data){ BstNode* temp3, temp4; temp3 = root; //temp4 = temp3; int i = 0; while(temp3!=NULL) { if(temp3 ->data == data) { return true; } else if(data < temp3 ->data) { temp3 = temp3 ->left; } else if(data > temp3 ->data) { temp3 = temp3 ->right; } else if(temp3 ->left==NULL && temp3 ->right==NULL) { return false; } } } int main() { Insert(15); Insert(10); Insert(5); Insert(2); Insert(20); Insert(25); Insert(30); Insert(35); bool a = Search(1); if(a==1) { cout

[@pianissimo7121]

thanks mate, will check it later if it works as intended or not.

[@nnnnnn2368]

@@pianissimo7121 sure...you are welcome

[@shubhamvishwakarma8309]

Excellent teaching, seriously loved the style of explaination and the content delivered. Thanks a lot for these videos. !!

[@donellmtabvuri7902]

Very good tutorial, I'm watching this from Zimbabwe.

[@alifyz]

Getting ready for the exam! Thanks for this awesome content!

[@abhijeetsinghrajpurohit8961]

bhai yarr... too good hai yrrr... really really grateful...

[@TacticalProjectGaming]

At 1:11:53 in C I had to write: struct Node* temp = (struct Node*)malloc(sizeof(struct Node)); instead of without struct... Was confused as to why it didn't work

[@TacticalProjectGaming]

@daniel Yeah it works in C++

[@Dana-pq7uf]

You need: typedef struct Node { int data; struct Node* next; } Node; instead of: struct Node { int data; struct Node* next; }; if you want to avoid typing struct every time. So now you can type Node* temp = (Node*)malloc(sizeof(Node)); instead.

[@LeelaseshuKumar]

I am sure, no one can replace him in this era. This is my second time watching this complete video. 🙏🙏🙏🙏🙏

[@akshat1234100]

Everyone studying from sucky useless Data structures professor in Indian colleges knows that this is the best playlist on DS

[@proper_noun436]

i appreciate how easy your english is to understand

[@ramankumar41]

Very neat and concise explanation !!!

[@unmandarinoalgiorno...9321]

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!

[@DogeCharger]

8:25:48 he sounds so sad about that

[@etpaprika]

Harsha must be cool and awesome that way. He was our legend.

[@thinkingmad1685]

@@etpaprika he is not Harsha ,he is animesh

[@מולטמקונן-י2ג]

Thank you My friend for this Video because of you I passed my Data Structures exam hope it makes you smile up there, RIP

[@yangsouza7369]

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!!

[@AviralDewan]

Literally Best Data Structures Course Ever!

[@MadManTheMoroccanVersion]

I highly recommend this course , it help me a lot after Allah in having a deep understanding of data structures.

[@SphereofTime]

5:05:40 Queue Linked list implementation

[@spiritual5750]

Video OP for the last 5 years. 🔥🔥🔥

[@oltechacademy7851]

In C programming, data types specify the type of values that variables can hold. They define the size, range, and operations that can be performed on the variables. C provides various data types, including integers (int), floating-point numbers (float, double), characters (char), and more complex types like arrays and structures. Choosing the appropriate data type is crucial for efficient memory usage and accurate computations in C programs.

[@arslanahmedqureshi2964]

it would be great idea to add captions so that non-English people can also get benefit from this course

[@ShivamYadav-in2jg]

best course for data structures on youtube !! thankyou so much sir

[@Ash-em5pm]

ProTip: Watching this at 1.5x saves 3hrs of your time (which you can use to take notes while pausing). The accent kinda goes away too.

[@Milka-br1xw]

Yea thats the way i always watch coding videos actually really worth!

[@imriziraza]

Excellent explanation of each concept. Must take by everyone interested in Learning Data Structures.

[@rachitmittal448]

Code for Linked List in CPP #include using namespace std; class Node{ public: int data; Node *next; Node(){ data = 0; next = NULL; } Node(int input){ data = input; next = NULL; } }; class Linked_List : public Node{ Node *head; int len; public: Linked_List(){ head = NULL; len = 0; } void Insert(int input){ Node *NewNode = new Node(input); if(head == NULL){ head = NewNode; len++; return; } Node *temp = head; while(temp->next != NULL){ temp = temp->next; } temp->next = NewNode; len++; } void Insert(int input, int position){ Node *NewNode = new Node(input); if(position == len){ Insert(input); len++; return; } if(position == 1){ NewNode->next = head; head = NewNode; len++; return; } if(position > len || position < 1){ cout next = (temp->next); temp->next = NewNode; len++; } void Print(){ Node *temp = head; if(head == NULL){ cout next = (temp->next)->next; delete deleted; } void Reverse(){ // Iterative Approach // Three Pointer Approach for Reversal Node *next, *prev, *current; current = head; prev = NULL; while(current != NULL){ next = current->next; current->next = prev; prev = current; current = next; } head = prev; } void Reverse_2(Node *p){ // Recursive Approach if(p->next == NULL){ // Exit Condition for Recursion head = p; return; } Reverse(p->next); // Recursive Call // Node Fix Node* q = p->next; q->next = p; p->next = NULL; } Node* GetHead(){ return head; } int GetLength(){ return len; } }; int main(){ Linked_List L1; L1.Print(); // output 'Empty linked list' L1.Insert(1); L1.Insert(2); L1.Insert(3); // L1.Insert(4); L1.Insert(5); L1.Insert(6); L1.Print(); // output the Linked list at this stage : 1 2 3 5 6 L1.Insert(4,4); L1.Print(); // 1 2 3 4 5 6 L1.Insert(4,9); // outputs Wrong Position cout

[@SphereofTime]

2:32:50temp->data=x; temp*(data)=x

[@ysislm]

🥺Very very Thanks..i am really waiting for this...can you guys make a Competitive Programming C++ full beginner-advance cource ..plz plz plz

[@andrews6282]

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.