Binary Search Tree - Insertion Pseudo Code

Video 66 of a series explaining the basic concepts of Data Structures and Algorithms.

This video explains the pseudo code for inserting into a binary search tree.

This video is meant for educational purposes only.

[aryanraje]

Can we just take a moment to appreciate her handwriting?

[no-maan]

this channel is extremely underrated. very good and easy explanation

[logicontips]

I haven't seen so simple and beautiful explanation, thanx I could understand it at once. Keep it up!!

[srana]

The is the best explanation so far. Now I can write the pseudo code without going back to video. Thanks a lot.

[shivampatel]

your explanation is so good even I can not tell in words, you cleared my all doubts . Please keep making this kind of videos.

[ashutoshsingh]

I think your recursive insert method call should be inside else case.

In that case that will only be called when root.left or root.roght are not equal to null.

Apart from above thing, your tutorials are awesome. I am learning ds in an easy way. Thanks a lot.

[pavanshanmukhaveer]

Your teaching skills are too good mam
Your explanation is simply superb❤️👌🏼

[admirald.rifter]

The dark horse of ADS structures... well done for your hard work

[mohammadahmedragab]

you explanation and code is super easy and simple, thank you so much ❤️

[roymamon]

im baffled from how good she explains things in her videos

[saurov]

Best bst insertion explanation on you tube 👍

[santiagosuarez]

I really thank you!! I ase every code, program and nothing is so nice teachead as your method. Thanks so much i will pass my class thanks to you

[ahtezazshah]

What value should we give to the root every time when we called the function insert

[b__aditidonode]

what as easy explaination ...amazingly taught

[vennu_v]

basically i don't comment for any videos, trust me very very very very simple and understandable!

[sumitkawale]

Thankyou Ma'am, You are so Beautiful in teaching..

[student]

Maybe I missed it but was there any mention of how to treat duplicates?

[jean-paulboga]

very much thanks, your explanation is great .

[AjayKumar-ezwi]

Thanks to you for this nice explanation

[redkaadda]

I've a question ..In Binary Search tree Elements of left subtree are less than root and right subtree is greter than root .Then how this example works ??