Binary Search Tree (BST) - INSERTION operation(with C++ Code) | Part 2 - Insert New Node Operation

[@MuhammadAbdullah-bf3ki]

When it comes to DS & Algo, I always recommend this playlist. Love from Pakistan ❤️

[@SimpleSnippets]

Glad you liked it! Lots of love from India ✌😇

[@MuhammadAbdullah-bf3ki]

@@SimpleSnippets ❤️❤️❤️

[@TheDrewCrawford]

Your explanations are so thorough and complete. I love how you never assume previous knowledge of the viewer and instead explain everything you are doing and why. This must have taken forever to plan and film. Thank you so much for sharing your knowledge.

[@dikshitupadhya4828]

Hello Tanmay. I was following this whole playlist and i completed all the DSA concepts that your playlist provides. But I really needed to learn DSA fast, so after completing your playlist, i shifted to a different one. You are one great teacher, and I literally couldn't find a better playlist than this. A very great thanks to you and your team for such amazing content.

[@dikshitupadhya4828]

I am a full stack web developer as well, so learning these skills really added up to my skill list.

[@SimpleSnippets]

Thank you so much Dikshit for such a wonderful comment. I will try to upload more often for all of you. Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇

[@andriykupinskyy4700]

I watched few different channels already and with this video I finally understood BST

[@sayandua9656]

This channel should be promoted by us as much as we can bcz he is providing quality contents. This channel is much much better than any other youtuber who are making video to only earn by telling either their college name or where they are employed. They do not making videos for providing quality contents(I think you are able enough to understand which channels I have meant . our so called now top education channel. May be you are following their video playlist to learn, but they can stop the playlist suddenly in between the course for their personal hostility.). There are also few more channels like codewithharry,smartprogramming who are working hard to provide us quality contents rather than earning money.

[@SimpleSnippets]

Thank you so much brother for such a wonderful support and your kind words. This really keeps me motivated to keep doing more & provide high quality videos for everyone 😊🤘

[@gargi_kar]

This is probably THE BEST DSA PLAYLIST in KZbin....The effort you give to explain each and every line of the code is on another level.....I just love all your videos and thanks a lot cause for you my Tree concept is getting clear...THANKS A LOT

[@SimpleSnippets]

Very happy to hear this from you Gargi 🙏😊 please do share the videos and the channel with your friends too. 🤘

[@gargi_kar]

@@SimpleSnippets Yes I have already shared it with my friends.

[@SimpleSnippets]

Thank you 🙏 this means a lot Gargi 😊

[@voidcry9757]

Thank you Simple Snippets. I am a loyal follower of this channel. I hope that you will be able to complete the tutorials as soon as possible. Once again, thank you for all the hardwork and effort you put into these videos. I didn't know that the Tree Data structures were so easy when explained properly. Keep up the great work that you are doing.

[@danyalhabib286]

Best Teacher ever 🤘

[@jamestogher1098]

One of the best explanations on youtube, thanks.

[@SimpleSnippets]

Wow, thanks!

[@triMaruti]

One of the best explanations on KZbin even love bhaiya did not try to make us explain at this deep level. Hat's off to you!!!

[@pranjalsinha3270]

Salute to you, sir. So Amazing content. I can understand how much patience and hardwork is put in this complete DSA series.

[@rohitpol]

Thank you so much all these Amazing/Excellent/BEST Lecture series

[@arpit5506]

Was waiting for this eagerly

[@SimpleSnippets]

Hope it was worth the wait ?

[@averageguy985]

Your Data Structure Tutorials have helped me a lot. Keep 'em coming ^_^ Much love from Pakistan

[@SimpleSnippets]

Thank you so much buddy. It would mean a lot if you could please share our channel and videos with your friends too ✌ And yes many more coming soon!

[@averageguy985]

@@SimpleSnippets I already did! It helped my entire group to study data structures and algorithms! Thanks a lot mate ☺️

[@yashgupta-rg5it]

Very nicely explained bro. Literally searched everywhere for this. Thank youuu

[@yashgupta-rg5it]

CODE: #include using namespace std; #define SPACE 10 class TreeNode{ public: int value; TreeNode* left; TreeNode* right; //consructors TreeNode(){ value=0; left=NULL; right=NULL; } TreeNode(int v){ value=v; left=NULL; right=NULL; } }; class BST{ public: TreeNode *root; BST(){ root=NULL; } bool isTreeEmpty(){ if(root==NULL){ return true; } else{ return false; } } // }; void insertNode(TreeNode *new_node){ if(root==NULL){ root=new_node; cout

[@kavanshah5512]

0 Dislikes 😉, That's The Power And Love Of We Audience 😘❤️🙏🏼, Great Explanation Mere Bhai, Really Great Explanation. And he's so down to earth that he replies to every single comments. ❤️❤️❤️❤️

[@SimpleSnippets]

Thank you so much 😀

[@SimpleSnippets]

Very lucky to have mostly a positive and supportive subscriber fam

[@amritpaudel8204]

Hey Tanmaya, I absolutely hate when people literally do not use Classes while doing DS Algo in c++. Being in c++ they implement data structures just like in c which is quite annoying and difficult to understand as well. You are doing great job bro, keep it up

[@gabrielcaldas9506]

It was very helpful!!!! Thanks from Brazil!

[@SimpleSnippets]

Most welcome 👍. I'm very happy to read this feedback Gabriel 👍😊 Please do share the videos & the channel with your friends too. That's the biggest help & support 👍😊

[@crazycovers762]

Excellent videos, thank you very much for taking the time to make these! You've really helped me gain a better understanding of dynamic memory and pointers too, which can be a tricky concept as a beginner

[@SimpleSnippets]

Great to hear! Thank you so much buddy. It would mean a lot if you could please share our channel and videos with your friends too ✌

[@Satvikshukla0007]

A very amazing and best video on youtube for binary search tree.

[@asta3532]

king of ds,salute,your level is really unbeatable😮

[@SimpleSnippets]

Thank you bro 💪❤️

[@krishnendudakshi3452]

Explanation was awesome😄Thanks for such explanation

[@salilshukla2686]

Very thankful to you Tanmay for making this videos. It helped me a lot.

[@deveshsinghal1291]

Vrooooooo...... mera viva isi ne accha kia ...... thanks .....👍

[@badhonbiswas3751]

One thing is common that I never missed to give a like in your all video

[@SimpleSnippets]

Thanks man. Really appreciate that!

[@omkarsalapurkar2981]

The explaination is better than the code awesome!

[@hishamkunjumohamed4427]

This was incredibly helpful. Thanks you so much for making this video.

[@SimpleSnippets]

Glad it was helpful!

[@prajjwaltripathi2911]

Thanks Tanmay sir, your lectures make DSA easy and much more interesting

[@lovevibes_320]

I'm loving your DSA vid.Infact everyone would be loving it.I humbly request you to bring the course of "ANALYSIS OF ALGORITHMS" as well.Thankyou.

[@shivamvishwakarma2712]

after a long time still i am very happy... : )

[@SimpleSnippets]

Thanks Shivam 😇

[@deepaklavate4165]

Thanks for such detailed explanation. Efforts appreciated!!👍👌

[@andriykupinskyy4700]

Thank you, great explanation, it was exactly what i was looking for

[@ManinderSingh-xr6ir]

Great explaination sir! Loved the way you teach!

[@mohammad_zrar]

Awesome explaining, good job.

[@SimpleSnippets]

Glad it was helpful!

[@manojchakole7734]

Hi, this is very impressive finally something different as compared to other Data structures videos specifically for Tree(others just show recursive approach only). Now, a very humble request to you, can you please make videos for Graph algorithms and Dynamic programming (particularly in C++). Hope you will. Thank you.

[@SimpleSnippets]

Thanks Manoj. And yes I will cover the topics you've requested. One request from my side too. Please do share the videos with your friends too ✌️

[@manojchakole7734]

Yes sure, but remember Graph algo and Dynamic programming videos should have Non-recursive and in written in C++. Thank you once again for your quick acknowledgement.

[@farhanuddin3250]

Superb explaination ......

[@computerscience173]

Bro your lectures are great and keep uplaoding them, doing great work

[@SimpleSnippets]

Glad you like them! Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇

[@fireship3007]

Thanks a lot for this video. Really well explained

[@SimpleSnippets]

Thanks buddy, I'm glad to hear this. Please do share the videos with your friends too. That's the biggest help and support you can give back to me 🙏😊

[@fireship3007]

@@SimpleSnippets I already have !

[@SimpleSnippets]

Amazing🤘

[@abhimannyumagar1033]

You are great for explanation for code 👌

[@itz_me_imraan02]

Crystal clear explanation... 🔥

[@SimpleSnippets]

Glad you think so!

[@John12685]

Sir pls upload daily or if not possible at least 2,3 video in a week please please please. Specially this whole Tree Data Structure should be completed as soon as possible pls Sir. Thanks big fan of yours. Love 💞

[@SimpleSnippets]

I will try my best but honestly these videos are very very difficult to make with such hi frequency and if I try to do that, it will not be of this high quality. Hence I take time to prepare the content. Hope you understand. I will still try as much as possible. Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇

[@yasirmumtaz2313]

huge respect sir❣💯

[@vithunchandra8420]

holy, nice explanation bro, salute. i more like this style of explaining, 1 function 1 explanation video and code, but yeah it is up to you.

[@bilalahmediftikhar9307]

Brother really Thanks by Heart. Very very useful and concept building.

[@ananyaverma9966]

Thankyouuu....it was very helpful!!

[@rajaadeel899]

Amzaing bro👌👌bassically you know how teach👌👌👌

[@ahmadmujtaba8138]

The best ❤❤❤❤❤

[@SimpleSnippets]

Glad you liked it! Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇

[@josephbenoy4169]

Bro thank you so much for restarting the tutorial series ! I have shared your videos for those who approached me clearing DS. I have got a doubt regarding the implementaton of BST , I have seen a lot of tutorials on BST which implements using recursion over the interative method and finally in your video I have seen you using interative method. Which method is more efficient or why most of them prefer recursion over interative method?

[@SimpleSnippets]

I think for small applications there is not much of a efficiency difference however when it comes to bigger applications with large datasets, recursion adds extra overhead as everytime you go deeper into the next recursive call, the call stack has to be updated with which function is supposed to be put on hold and that takes extra time and space. check my separate recursive function video in the C++ tutorials course.

[@josephbenoy4169]

@@SimpleSnippets Thanks for your reply bro

[@pamp3657]

GOOD VIDEO THANK YOU

[@lokeshghule3066]

Thank You!!

[@SimpleSnippets]

You're welcome!

[@HardeepSingh-jn9pc]

Superb explanation

[@engineerkurtivala1317]

Thnx for a great lecture

[@SimpleSnippets]

Most welcome. Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇

[@krishvaghela3182]

DON't forget to make bst default constructor or you will get "segmentation error".

[@devmahad]

Thanks boy! Hat off to your effort

[@abdulsameer6300]

love your explanation

[@SimpleSnippets]

Glad to hear that!

[@arpitkhandelwal6050]

well explained video. Thank you

[@SimpleSnippets]

Thank you so much Arpit. I'm very happy to read this feedback from you. 👍😊 Please do share the videos & the channel with your friends too. That's the biggest help & support 👍😊

[@aakankshatiwari0015]

You really made it easy

[@SimpleSnippets]

Hence Simple Snippets 😊🤘😊

[@kumardigambar1664]

Thanks sir👍👍

[@dhawalpatil7779]

Best video 👌

[@theo9362]

Thanks, this helped

[@hamzajamil2750]

Hi! Hope you are doing well. I am from Pakistan. Firstly, Thank you so much for such a great series of videos, i really appreciated. Your videos are really easy to understand and I am always watching your videos and gain as much knowledge as possible. Secondly, Can you make more videos on DATA STRUCTURE Topics like HEAP, AVL TREES and HASHING. Moreover, you are a great person. Thank you so much for great videos and please carry on and come up with more topics. PS. I usually don't comment on any video but you made me to do that. :)

[@hamzajamil2750]

Waiting for you response.

[@SimpleSnippets]

Hello Jamil, thank you so much for such wonderful comment buddy. I am very happy to hear this from you. And yes buddy many more topics including the ones you mentioned will be covered in this DSA course. Please keep sharing out channel with your friends too. Thats the biggest support you can provide.

[@_kuchbhii__1]

I have a question, when we enter the value to insert is BST the left and right pointer gets the address automatically? We don't need to pass the address? I am a bit confused here.

[@sakshijangra]

because each node has some address and when we join two nodes lets say A->left = B; it passes the address of B & A's left pointer has the address of B. As we are always storing the new_node to the left or the right of any node in the tree, each node has some address or NULL value.

[@meenakshiswethasri4646]

Can you refer us any book for more practice and questions to do?

[@Shashee99]

😍 thank u so much

[@abdulfaiq9458]

thank you sir bro

[@panchambodake2597]

Sir, How many time required you to complete the DSA series??

[@zshan3251]

we use dynamic because we want to create it once in the memory. while the other way is like when the loop completes one iteration it will consider it another object that is created just by now? and all the time values will be set at the root node?

[@SimpleSnippets]

Correct. When the loop refreshes that object is destroyed. But using dynamic memory method that object is alive in the heap memory ✌️

[@avinashvenkat7819]

awesome bro

[@syedmaaiz1]

Great video! can u add the full code for all the functions of trees in the description from next time regardless of whether you have already explained/reached that section on videos?

[@hammadmansoor6960]

Hey, I was trying to implement the insert function, but the program exits after every insert and then I can't access the menu. Any idea why that could be happening? Thank you!

[@sakshijangra]

I faced the same issue, I found that I have created BST *obj; (Pointer object of BST class) while I should have used BST obj; (Object of BST class) so it was creating problem

[@GodD.Immortal]

where I can find this code? I tried to find out that code on your website but I couldn't, so if you can please share the link here please :-)

[@hamzashahshah3953]

Love u from Pakistan!!

[@SimpleSnippets]

Thank you so much buddy. It would mean a lot if you could please share our channel and videos with your friends too ✌

[@hamzashahshah3953]

My friends recommend me... Peace ✌️

[@hklite]

Please make a video on hash tables, it's a request.

[@user-nm4vn9tq5o]

Print 2D function is printing only left child nodes even if I inserted nodes to the right ..... Please provide correct print function...Hope you have corrected it in further videos.

[@nc8002]

can you do insertion by recursion?

[@umarajmal6216]

brother what if we enter a very low number as a root node value like 1 then every node will on right side ? if values are greater

[@vaishnaviandhalkar2673]

I am getting values stored in the root node always. what may be the reason?

[@Shellaijaz]

I have a question that's: can't we do all this work in one class?

[@anshupatidar7928]

Why are all the functions like insert node made inline, i.e., body of methods is provided inside the class ? I had learnt that make a function inline only when the body is simplified(no loops, short, no conditions like if-else). Please tell.

[@abdullahkhalid2679]

Can you plz do these in java too?

[@SaurabhSingh-lk5oz]

sir we want a video on binary tree implemntation......

[@pritamdevdare5232]

why two constructor created in TreeNode?

[@mylittleworld1668]

sir i have a QUESTIOn !!! why do you make isEmpty() //function?? what is its use ??

[@akashbodhale7352]

sir your ds vdo are too useful... i am eager to know that you gonaa upload inorder,preorder and postorder display code ??

[@SimpleSnippets]

Thank you so much Akash. And yes I'm working on these traversal technique so expect next video on these topics soon 😊✌️

[@akashbodhale7352]

Sir if you just explain dry run in 1st vdo (without recursion) and code on 2nd then also we will get it cause your explanation is truely amazing..👌👌

[@SimpleSnippets]

@@akashbodhale7352 thank you Akash for such a positive comment. I'm very happy my explanation is easy for you. Please share our videos and channel with your friends too. 👍

[@sakshisinghal1669]

what is the difference between TreeNode* new_node = new TreeNode() and TreeNode* new_node = new TreeNode ?

[@SimpleSnippets]

Try it out.

[@sakshisinghal1669]

@@SimpleSnippets I tried it but both are producing same result. That's why I am asking for it.

[@dheepakraaj8352]

@@sakshisinghal1669 when u don't put the brackets then the default value of that dynamically allocated TreeNode is not set to zero whereas when u put brackets they are set to zero.

[@sakshisinghal1669]

@@dheepakraaj8352 by avoiding brackets the TreeNode is set to some garbage value. This is what you want to say?

[@dheepakraaj8352]

@@sakshisinghal1669 s crt😄

[@dineshs387]

sir make video on other operations too

[@itz_me_imraan02]

Plz include graphs too..

[@marvel_marvel5708]

Hey tanmay Why would you allocate memory outside of switch. I think if you allocate memory inside of switch case 1 you can save some memory. It's just my thought because we do not need a new node except in insertnode. So please respond and if my thought is incorrect can you give explaination. please anyone can think of this

[@lokeshjhanwar7603]

Hello sir Can u tell me what is advance DSA

[@SimpleSnippets]

It will have multiple DS used together with more complex algorithms and topics like dynamic programming etc

[@student6555]

29:23

[@JaskaranMega]

Recursive solution?

[@SimpleSnippets]

Check this - www.geeksforgeeks.org/binary-search-tree-set-1-search-and-insertion/

[@kunalpadwal3957]

Hlo Sir, I want to learn OOPS in C++.and you have already provided vedio on it but can you please make a playlist of that so that there will be no confusion. Thanks a lot.

[@SimpleSnippets]

There is a full playlist of C++ Programming for beginners which has all necessary OOPs concepts covered.

[@menahilmalik5449]

Why Your Website is Suspended?

[@naseehashahjahan2266]

sir you are awesome...!!!but i didn't see the BST code in website can you kindly share this entire insertion code link to me

[@SimpleSnippets]

I'll update that soon on the website once we finish all operations ✌️

[@turzosaha3789]

Bro! plz upload next videos

[@LyricVista]

how insert function write in recusive

[@piyushgupta9344]

More compact solution: void insertNode(Tree *node) { if(root==NULL) root=node; else { Tree *temp=root; while(temp!=NULL) { if(temp->data==node->data) temp=NULL; else if(temp->data>node->data) temp=temp->right; else temp=temp->left; } temp=node; } }

[@golden_bish]

Bro, Are you going to make a tutorial on fibonacci search concept in upcoming videos? I think it would not be possible for you because, you have already completed that searching concepts. Anyways thanks Genius.

[@SimpleSnippets]

Hey Aakanksha, I have already covered fibonacci series long back in other playlists like C++ and Java. check my channel and c++ playlists or java playlist you will find it. :-)

[@golden_bish]

@@SimpleSnippets Yes I have watched that video few days back. But bro, I am asking for the searching algorithm using fibonacci series (like linear search and binary search). Becoz, that's a type of searching and sorting concept. And Sentinel search too. Becoz, The concepts which I fill like disaster, becomes crystal clear and strong after learning it from ur series.

[@SimpleSnippets]

I didn't get your query. Can you elaborate of what Fibonacci has to do with searching?

[@golden_bish]

@@SimpleSnippets I'll mail u wait

[@drazumi7391]

I got my lab endsem tomorrow and whatever value I insert it says that value already inserted, even tried copying your code... any solutions? this is the code : void insertNode(TreeNode * new_node) { if (root == NULL) { root = new_node; cout value) { cout left == NULL)) { temp -> left = new_node; cout value) { temp = temp -> left; } else if ((new_node -> value > temp -> value) && (temp -> right == NULL)) { temp -> right = new_node; cout