Binary search tree - Implementation in C/C++

[@ahmeddeghady4510]

I'm a simple man, I see recursive function, I panic.

[@savitar8183]

lol me too

[@fawadmirza.]

I thought you were a simple cat

[@piyushnandurdikar9234]

haha.. epic

[@adityasahu96]

I hope you don't mind me putting this as my status

[@palashbundele535]

xDDDD

[@HollowPiero]

You make me understand in 18 min what my teacher couldn't in 2 hours. Very Good.

[@mycodeschool]

Thanks :)

[@pradeepkumaryadav9641]

yes this videos are brilliant

[@chaudharyadityakumar6149]

bro your r awesome.Why your not making new videos.I am in graduation and I am studying programming from 9 class ..I have come across many teachers but you are amazing. You can be one of the best programming teachers on youtube.

[@zacharyhe5719]

that's the real thing

[@chaudharyadityakumar6149]

bro i recently find out that the guy is dead

[@simpleffective186]

this guy is the best teacher ever and you can't even find his name on the channel. Thank you for your work, humble Animesh Nayan.

[@solomonleo3025]

7 years later.... Teachers at clg:- Still sucks at DSA mycodeschool:- Still rules at DSA

[@abdellatif.x8127]

XD

[@nguaial8490]

You are much better than most of cocky PhD professors who needs to learn how to write neatly and speak slowly. Most of professors are trying to show off how smart they are. So arrogant ...

[@AliRazaiamaliraza]

You should respect your teachers, no matter how they are and what they do... -_-

[@elvisdurmishi9893]

Ali Raza no you shouldnt,respect is earned,if they don't know how to teach then they should just quit and stop wasting everyones time

[@daliamohamed2858]

why should i ? i paid money to learn if they r bad they should quit and stop wasting my time ! or to do researching staff far away from teaching n wasting time !

[@sujoymitra1012]

Ali Raza u r right, u should respect ur teachers, no matter what they know or teach, and most importantly how they teach but in some cases if a teacher boasts about his knowledge in collg and that doesn't quite seem nice off course, that may be wrong on the teacher's part irrespective of whether the knowledge the teacher has is right or wrong.

[@TheseEyesSeeDarknessClearly]

Idiot. @@AliRazaiamaliraza

[@MikeAllaway]

Your videos are brilliant. Very clearly explained and thorough. They will help many people and you should be proud of your great work

[@mycodeschool]

Mike Allaway Thanks a lot :)

[@robinfr93]

I second what Mike said!!

[@GGlearn]

best teacher ever

[@shivachandrachary]

Omg!, I couldn't have asked for a better explanation. It felt like I coded the whole algorithm myself. Thanks!!

[@Jamesbond-vy1rq]

10 years ago , and still the best data structure professor . Better than my university professors 100 times . Thank you dear.

[@abhijeetjain8591]

rather than just saying "thank you" in comments , we should also turn off adblocker while watching these awesome videos !

[@gericapo8739]

Fair

[@shyam5631]

He is dead.

[@ekashto]

@@shyam5631 How do you know?

[@shyam5631]

@@ekashto he was a popular person and also he was a red coder.

[@vighneshk509]

@@shyam5631 dude his partner passed away not him there were two guys

[@modguy9894]

8 years gone by and it still is more valuable than the class lectures

[@Panaxis]

In 18 minutes I just learned way more than I did in class since January. Thank you so much! I cant wait to watch your other videos!

[@austinbvi]

You're an angel! I'm binging the entire playlist prepping for an interview.

[@shivamdhir640]

how did the interview go ?

[@austinbvi]

@@shivamdhir640hmm I did a few that season and don’t remember which that comment was referencing but overall went like 4 for 6 offer-wise-this playlist is great, I’d crank out leetcode problems related to the topic alongside the videos

[@veereshranjan3519]

The explanation about BST was splendid but this is a master piece because you not only made the concept clear but also implementation in the actual program.. hats off

[@chuanyu8813]

The best video I have seen until now for explaining data structures and algorithms. Fantastic! Clean and concise!

[@inclinedscorpio]

*Could you please teach my teacher ?????*

[@gauravchatterjee4313]

LOL HAHAHAHA

[@phuckhoinguyen6938]

Best comment =))))

[@abhi_pandit16]

Bro,,He is no more 😢

[@ninja-gh]

@@abhi_pandit16 Bro what are you telling?

[@tanishqsaxena597]

@@abhi_pandit16 seriously ???

[@abhishiekmahajan9103]

You make it so interesting ,this 18 minutes were shortest in my life.

[@pcpardon]

Even though, You are long gone, your work and legacy still inspires me. Even today, when I wanted have quick refresh on my basics, I would still visit here. May you attain nibbana.

[@pkj6962]

He had a great sense in making videos. He made video in the way students who just search the keyword and don't follow the data structures courses.

[@johnhurley8918]

Thanks to this playlist, I've been reviewing the content of an entire college coarse so far in one day. Pay attention kids. I need to know these concepts for my job interview tomorrow.

[@vidzpk5144]

I know it's late but did you get the job? and did they ask about Data Structures?

[@edwarddeitner3006]

Unbelievable, I am really bad in English but I understand almost everything what you explain in this language, which is pretty strange for me. It is like Einstein said: If you cant explain it easy enough you do not understand it well enough. And you understand it absolutely, so your explanations get great!

[@offchan]

9:45 You could pass pointer by reference and that would do the job best. void insert(BstNode*& root) is the best way to pass a pointer that you want to changes its actual address. Normally, if you use BstNode*, you are passing pointer by value which means you can change the dereferenced data the pointer is pointing to but you are actually copying the address of the pointer so changing the address of the root inside function won't affect the actual address of root in main. Summary: Pass pointer by reference *& so you don't need to return the changed address to the caller. Passing pointer as a form of pointer like you do also does the job but I think it's too confusing and look superfluous.

[@andrethomazjr.1845]

thanks man... I love you

[@aditya6542]

But wouldn't it require to create a temporary pointer variable because the function is changing the address in root. I know this reply is far apart, 5 years to be precise. I am currently studying this, read your comment wondered about it

[@offchan]

@@aditya6542 BstNode*& internally works similar to BstNode**. It means that it should consume the same memory. It's just that the syntax is easier to understand. Here's how to use it: BstNode* root = NULL; Insert(root,15); void Insert(BstNode*& root, int data) { if (root == NULL) { root = GetNewNode(data); } } I don't remember the syntax quite well because I haven't written in C++ for long now. But it should be something along that line.

[@aditya6542]

@@offchan Thanks a lot for taking time to explain me. I just tried call by reference method suggested by you and it worked like a charm and the code is now even more readable.

[@mohammedjakhirhussain8699]

@@offchan hey I tried code and works very well but, I have another doubt in this code, if you notice at 16:16 the root is currently pointing to address 500. but what if we want to insert 21 at left side of 20(address 300).please help I am so confused.

[@radmehrvosoughi]

How simple man, thanks god we have India

[@rohankumarshah5679]

the idea of pause and play in recursion is lit, great job!!

[@wilacademy8916]

Sir, a thousand of thankyou. i love you sir. i'm now preparing for my next term in computer engineering major. i'm so very happy now im study with the best code channel.

[@madjayhawk]

You are an excellent teacher. Very organized with perfect graphics.

[@wondertale12]

sir awesome i didnot understand the recursion from last 2 months in trees but your video is just miracle for me now i understand how the recursion is work in tree step by step keep it up sir

[@justcallmeRISHI]

Great work Sir, RIP legend, still revising this material.

[@muhammadsaadjr9215]

what happen to him?

[@manojpandey7517]

3:08 A self-note; Any object created in dynamic memory/heap can only be accessed through pointers.

[@vojvoda-draza]

yup

[@yashasvibajpai4702]

Sad to feel that this legend is no more in this world!!!! He will still remain eternal on KZbin and help everyone forever!!!!

[@souravsingh763]

What??

[@yashasvibajpai4702]

@@souravsingh763 yup bro...He succumbed to his injuries.

[@bantyburange888]

code in C language #include #include struct bst{ int data; struct bst* left; struct bst* right; }; struct bst* newnode(int data) { struct bst* temp=(struct bst*)malloc(sizeof(struct bst)); temp->data=data; temp->left=NULL; temp->right=NULL; return temp; } struct bst* insert(struct bst* root, int data) { if(root==NULL) { root=newnode(data); } else if(data data) { root->left =insert(root->left,data); } else { root->right=insert(root->right,data); } return root; } int search(struct bst* root,int data) { if(root==NULL) { return 0; } if(root->data=data) { return 1; } else if(data data) { return search(root->left,data); } else { return search(root->right,data); } return data; } int main() { struct bst* root=NULL; root=insert(root,15); root=insert(root,10); root=insert(root,20); root=insert(root,25); root=insert(root,8); root=insert(root,12); int num; printf("Enter a number to search "); scanf("%d",&num); if(search(root,num)==1) { printf("number is found"); } else { printf("number is not found"); } }

[@LaTiNScOrPiOn33]

I haven't even started this video and I already know it will be amazing due to your previous videos. Thanks for the helpful video!

[@VaLeEBP]

I really appreciate your work mister, you help me out on many of my programming problems with this videos, thank you so much :) Saludos desde Tijuana B.C. México

[@ismughal38]

we learn it here in minutes because our teachers spent hours to make base for this............very good video

[@pallavivanarse1685]

Very good explanation with good clarity of binary search tree implementation ...I never see such good explanation anywhere ... I really appreciate the person behind this channel .. thanks for providing such nice videos

[@AngoraKat11]

I am glad I stumble upon this video to understand BST. Thank you and keep up the good work!

[@jonathanlim2269]

Great explanation, clear, concise with good linking to previously learnt concepts both as a reinforcer as well as a reminder for those who have lost touch them them

[@ShahidNihal]

The best video I've found on bst. God, I was stuck at the "pointer-to-pointer" code, but your code with a single pointer made my life easy. Thanks a lot!!

[@Saradomin65]

You're a great teacher tbh. My teacher teaches us only how to do the BST tree and just leaves us to do the codes on our own without using the internet :(

[@ChandraShekhar-by3cd]

Perfect Video Ever On BST...Such a GlassClear Explanation...Just wanted to add here that instead of using a separate function GetNode we can manage the node creation in struct itself as below : struct Node { int data; Node* left , *rigth; Node(int data){ this->data = data; left = right = NULL; } }; So instead of calling method we need to do simply new Node(data);

[@viveksuman9600]

@10:22 is there a need to write "root=" in all insert calls? Is it fine to write it only in the first insert call so the first root node is created and we have it's address. There's no need to collect return everytime, right?

[@AakashYadav-ch9un]

I was looking for this exact comment only

[@AakashYadav-ch9un]

I am thinking the same dude

[@harshmehta4956]

10 years later, here we are

[@KeLi-r1x]

Haven't learned C/C++ before but got it thoroughly. Thanks !!!!!!!

[@LetTheWritersWrite]

Fantastic lesson. I just want to point out that the addressing can be simplified so much by making a class instead in C++ that will save the pain of referencing addresses and whatnot.

[@ArpanPathak]

Best teacher in this planet ,, Heyy you can avoid writing struct node every time by using typedef keyword typedef struct BstNode { int data; BstNode *left; BstNode *right; }BST; Now we can simply use BST

[@vishalvibes_]

it would become confusing for beginners.Thats why he always keeps telling the syntactical sugar thing for ->

[@prince5922]

@@vishalvibes_ sugar thing? you moron.

[@qR7pK9sJ2t]

@@prince5922 PKMKB

[@mumtahinaparvin7668]

your implementation is better than my University teacher,thank you

[@tannerbarcelos6880]

super good explanation! I was like "what the heack is a pointer reference' but now i get it. the new node being dynamically created is basically a pointer to a node so when calling insert privately, that is the pointer passed in as reference. Makes more sense after thinking about it more.

[@suchonprasert5857]

IN 2020, You still the best teacher bro,ur teach so good

[@wojciechkus3010]

10:23 double pointer part saved me thank you so much

[@manushreev6573]

A very clear and precise video lecture. I was searching for this type of video. Thank you

[@mashable8759]

BEST EXPLANATION, Better than all the teachers :)

[@dimitardzorlev6283]

rest in peace. you are the best. You teach great.

[@ediccartman7252]

Thanks a lot for the clear and detailed explanations and let me correct you a little bit. You always say, that in C we can't write, say , , but always . And the point is that you can. You have to write just once - in your definition of struct. And then after closing curly brace just write BSTNode and semicolone at the end. Since then you can write a short form - just BSTNode....blabla

[@greenpearl3404]

there should be a button for salutation. like is not enough to express my gratitude

[@abexoxo]

Thank you sir. You have a very clear step-by-step manner explanation of the BST design. [prayer]

[@MisterNorthernCanuck]

You make so much more sense then my teacher, many thanks

[@rammohanreddymedapati6890]

your explanation and coverage of examples are very good sir,, Thank you

[@lituhalder]

i could not leave this vedio without giving thanks to you

[@abkedare]

Best data structure tutorial I have ever seen

[@asadanees781]

Really Great explanation better than my professor. Awesome

[@mariyamamreen439]

Thnkuu so much sir ❣️😍😍😍method of teaching is brilliant I have seen many videos on topic trees but even any single video not help me like ur video 💞💞💞again thankuu so much GOd bless uh

[@JJLiu920]

hey i just found you, and this is crazy, but here's my like and my subscribe, because i have a feeling that you are going to save my entire module.

[@muhammedimdaad]

I felt returning and updating the root nodes after every insertion could be improved. So here is my code of using pointer to pointers. BTW this series is the best content out there. void Tree::insert(Node **rootPtr, int elem) { Node*& root = *rootPtr; //root is an alias to what is pointed by rootPtr, now instead of using *rootPtr, can use root if (root == NULL) { root = getNode(elem); cout

[@mawsn]

I wish I could like this video more than once, pure gold!

[@SuperBhavanishankar]

great to have a class on this, that benefited me, which my college can't provide. thanx a lot!

[@squirrelgaming4028]

thx for everything you've made everything much simplier to understand ,you're brilliant sir

[@TheGamer720x]

The most amazing explanation with proper example+animation. Cheers !! Helped a lot !! Thanx !

[@usufarif]

Excellent discussion on Data Structures, great detail and crisp content. Thanks. Yusuf Arif

[@jeffreydilley3380]

Where have you been all my life? Why are you not my Professor? Only thing that would have made me love this video even more is if it was implemented as a class.

[@manishkanyal4003]

Video is great and explained every concept clearly. This video is helping ne for preparing for my exams.Thanku codeschool for making such an awesome video tutorials.

[@ab3l588]

Great explanation- the play and pause symbols really help! Thanks a lot :)

[@priyabalakrishnan4093]

Had been waiting for this implementation video!!! Thank you!!!

[@jonathonvandergriff2299]

Excellent coverage -- this is better than I had back in college.

[@RajaSekharpraveen]

haw....... what a video remove all confusions in mind in single shot with in 20mins u rocks good video

[@1234CDAB]

You are such a great presenter. Thank you, keep up the good work

[@elvegaalberto]

Your tutorials are so easy to understand. Great job :] and Thanks :)

[@sarthakvaish2520]

Best 18 min on trees

[@ilanaizelman3993]

Listen, this is FUCKING PERFECT!!!! thank you very much

[@kikakky]

It's really helpful for my final exam!! Thanks for your hard work! ;)

[@_captainfalc0n]

That was soo clearly explained. Thank You.

[@nick1f]

You make incredibly good tutorials, thank you so much for sharing them with us.

[@sahil1053]

i did it without recursion then saw your such a beautiful code, and mine is 🤦‍♀️🤦‍♀️🤦‍♀️... the you said ... do it without recursion then I was like 😃😃😃

[@sankalpsingh7796]

Thank you humblefool for making learning so easy. May your soul rest in peace!

[@eiearunkumark8795]

Thanks for the code its very useful for me and its very clear to understand thanks once again

[@ashishkumarg5]

very lucid, concise and clear... (:thumbs up:) ... Great work

[@sidekick3rida]

17:27 I think the second "else if" should read "else if(data < root->data) ...". The first "else if" catches the case where "root->data == data". Although, using "

[@gauravbansal5746]

simplicity at its best

[@danimanabat5791]

THANKS A LOT! DSA LIFE SAVER THIS PANDEMIC T.T

[@sohambhattacharya767]

8:22 C++ was derived from C,and is largely based on it,but there are some legal C constructs which are not legal C++. Conversely, ANSI C inherited several features from C++, including prototypes and const, so neither language is really a subset or superset of the other; the two also define the meaning of some common constructs differently. :)

[@vidhansharma6650]

Lovely lesson..... very clearly explained thankyou

[@backdoorguy1]

Sir, you are doing an excellent job........ kudos to you

[@saraswatirathore3933]

Sir I really appreciate you effort to make us clarified

[@bkboggy]

Great videos (watched 28 of them thus far), but don't make a mistake of thinking that C++ is a superset of C. There are programs in C that won't run in C++ and there are programs in C++ that won't run in C. They've diverged in '98.

[@AliHassan-td7ss]

End sir g your way of explain are so easy❤

[@narayananrenganathan765]

Great, you make me understand my basic doubts.

[@unsaturated8482]

you're videos always helped me thank you. very much

[@kafychannel]

thank you so much finally I have got how recursion works) It was really difficult for me to understand how it works my brain merely refused to take it ))

[@daoanhtuandao8106]

your video is very useful . very clearly explained . I hope everybody seeing too .

[@ashutoshkhairnar]

Thank you so much for your detail explanation.

[@Pandorarl]

still the b(e)st tutorial out there in 2023!

[@techblog1491]

A lot of love brother...You are very brilliant