Binary search tree - Implementation in C/C++ 

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

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

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.

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!

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

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

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

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

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

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

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

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

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

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

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

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

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

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!

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

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

For anyone interested in a Python version, check out my recent lesson: ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-f5dU3xoE6ms.html

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.

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

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

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

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.

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

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.

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.

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.

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

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

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

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.

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!

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

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

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

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

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

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

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.

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

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

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

im here 8 years later and i cant thank you enough

That was soo clearly explained. Thank You.

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

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

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

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.

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

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

Best data structure tutorial I have ever seen

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

Hey there , thanx for uploading videos. They help our group very much in understanding the complex concepts in a very easy manner. And we want a complete playlist on algorithms like the playlist of data structure that you have made.. can you please help us??

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

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.

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

dil khush ho gya bhai aapki video dekhkar dil se thankyou

BEST EXPLANATION, Better than all the teachers :)

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

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

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

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

Great, you make me understand my basic doubts.

You are an amazing teacher ! thank you soo much!

Thank you so much!! You are the best professor

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

Really Great explanation better than my professor. Awesome

Your videos are very helpful.Thank you so much sir.

Thank you very much for making this video. It helps me a lot during learning binary tree. Really great tutorial for a self learner like me! I read several books but only became clear after your video. In the main function, are the root = insert (root, vals) necessary, except the val = 15, which is the first one? I think the following insert function don't modify the root. Please correct me if I'm wrong (I'm a completely newbie to programming).

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

You are AMAZING! MANY Thanks! from Brazil :)

your implementation is better than my University teacher,thank you

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

Sir I really appreciate you effort to make us clarified

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

Thanks for your great effort. Great teacher!!

Thank you so much for your detail explanation.

This was beautiful, thank you very much

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

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

Your videos and explanation are simply fabulous. It can make even a layman the best programmer in this world. Best wishes for the fantastic job you are doing without any consideration. It's very rare to see this quality. I have a quick question on this tutorial. In the main function the root variable is being used to call the Insert function. by calling subsequent Inserts and then coming back How come root will always remain at memory address 200. I believe it will always move to the next node. When you are calling search how come root is at the beginning i.e 200 without initializing it to starting address. Thank you in advance.

Very very good explanation. i finally figured it out.

You did it very well.. just loved your way of teaching.... (y) haha i learnt Tree in almost 1 or 2 hours what i couldn't in my whole semester though it was my fault..

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

Lovely lesson..... very clearly explained thankyou

Nicely explained, thanks for sharing!

these videos teach me so much in so little time .. :) thanks a lot mycodeschool

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

Great video! You touched on using malloc and new interchangeably. I think for CPP it's best to use new only, since it works together with the delete keyword. delete also calls the corresponding destructors of objects created with new, while the free function (used in C to deallocate memory) does not. Or do you have another reason that I don't know of talking about the use of malloc in CPP.

i could not leave this vedio without giving thanks to you

I'd just like to say LOVED IT. THAXXXXXX

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

thanks, finally i can say i understand recursion stuff in trees

Thank you so much :( I was looking at an example that answers my homework exactly and just sitting there like what,? I feel so bad at this still and I've almost got my associates. I understand what this video is talking about and I really like how it shows many different ways of writing the same thing. Even though this video is 18ish minutes I spent an hour going over it. Thank you thank you x.x :(

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

Please keep up this good work, you are making my engineering easy and intresting

How simple man, thanks god we have India