Insertion of Element into BST - Binary Search Tree | Data Structures using C

picture perfect sir,,,,,🤩😍

Thank you for the explanation, sir. I have now a better understanding of BSTs.

Sir please give a complete code for BST deletion

Nicely explain sir ..plz provide source code

NICE SUPER EXCELLENT MOTIVATED

What a teacher man❣️

Everything I understand !!!! Bust inside we use current!!! I could not get that!!!

very easy and simple code...and wonderful explanation

Thanks sir

Sir i have a doubt that we can use curr know every time . What is the reason of copying it to the parent everytime 🤔

sir pleas upload all type of sorting lectures

Best explanation.!!

Amazing lecture sir thankyou!

please can anyone refer me a good book which can be helpful to understand data structures and algorithms ?

SIR you saved me, today was my practical exam.

why we are taking 2 pointers, parent and current to store root value?

best sir ever !!! thanks sir !!!

sir apne srrruct node *p initialise kia h lekin hr jagh ap parent nam le rhe he ....jbki parent to khhi declare hi nhi kiya

Sir, thank you, it helps a lot

Sir please upload graphs,hashing and file organization in data structures

Honestly you are the best instructor of Data Structure. thanks alot!

sir you are great...

Explained really well!!

one of the best lecturers

The way u explained this program it makes doubts very clear. Thanks a lot.

Thank-you sir!👏👏👏👏👏👏

watching in Kanpur

Best teacher.. 👌

can we insert character type data in anode

Your class is so interesting and much clear and to the point. Thanks for sharing your knowledge and experience. do you have BST Binary Search Tree and its operation ( insertion, deletion, and traversal ) in Java? I mean the same class you have done in C I want them in java. please share link if you already have done it. Thanks

Best teacher I have seen... really helpful sir💯 thank you so much✌️🔥

Sir, it would be very much helpful if u would attach a txt or c file with program code in it at the end of every topic

Sir what if current->data is equal to parent->data!
Where will be the new node connected at right or left ?

if we have to insert same values two times in BCT

Well elaboration sir....❤️

Amazing explanation sir 👌👌👌👌👌

Thank you so much sir for such great lectures..the way you explained is just awesome..it becomes very easy to understand the concepts.

Sir,please explain the time complexity

Parent pointer have not declare

Tough af 😢

bhakk sala boka choda ganda ka andha jis padha raha h

Always amazing

Anyone help me more with this program

Way of exaplaining good sir thank u

You explain so well sir

best teacher👍👍👍👍