Binary Search Tree - Insertion Pseudo Code

[@no-maan1020]

this channel is extremely underrated. very good and easy explanation

[@aryanraje2770]

Can we just take a moment to appreciate her handwriting?

[@intrepid18]

Yeah call her , I'm ready to take and make that moment

[@fallennub145]

No

[@logicontips9490]

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

[@srana977]

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

[@shivampatel8850]

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

[@night6414]

you are the best ds teacher in the world, thanks a lot mam

[@pavanshanmukhaveer8566]

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

[@admirald.rifter1819]

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

[@mohammadahmedragab837]

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

[@xoxo-yp1fc]

the most underrated yt channel

[@roymamon1568]

im baffled from how good she explains things in her videos

[@saurov4606]

Best bst insertion explanation on you tube 👍

[@sayingsofislam1]

Very easy and good explanation for beginners 😊

[@khushikareliya6042]

Great work, perfect explanation!

[@santiagosuarez8479]

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

[@ashutoshsingh5568]

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.

[@balajiramadoss6014]

This is awesome !!
Note: you should have good understanding about recursion before
learning this.

[@Poojasaini-sb4dp]

Fabulous ❤❤❤

[@b_01_aditidonode43]

what as easy explaination ...amazingly taught

[@ahtezazshah1879]

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

[@sumitkawale9878]

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

[@student4373]

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

[@pyc0d3r]

Thanks with love from 🇳🇬

[@marwanabed5420]

inside main when i call method i send value and root what i send to it

[@redkaadda1035]

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

[@godza4735]

You are the best please keep goingg!

[@anuragsoni2256]

very nicely explaned! . Keep it up.

[@nasirsoft5800]

superb way of teaching ...

[@JP-programming]

very much thanks, your explanation is great .

[@sarahalabdulqader8886]

thank you soooooooooooo much 💕💕💕💕💕💕💕 you make it much easierr❤❤❤

[@toussaintmugisha5551]

this is what I was looking for

[@-ramya]

In insertion and deletion why time complexity is more can you plz tell why..

[@rddler9238]

Much respect !!

[@marry-sh3713]

Really thankful for you♥

[@Abhishek-bo9ge]

Best video ❤️❤️❤️❤️👍👍👍👍👍👍

[@AjayKumar-ez7wi]

Thanks to you for this nice explanation

[@ellareck6839]

Is there a way to do this without the root parameter and just the value?

[@JatinBedi69]

Bohot ache se likha ma'am

[@nvarma2189]

Good explanation ❤️💜❤️💜

[@vennu_v9392]

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

[@sameeratsadipirala2886]

When you are trying to insert 2, I think we should have insert as else part of if(root-left == null)

[@thaisclxt]

Root 1 is lass than value 2, so it's in if(root.rigth == null)

[@fairlyfire]

Can I have code for deletion too?

[@diegorocha2186]

Very good explanation, you just missed return or else clause after create a new node to put in node.right or node.left.

[@Zainab-ry5nb]

Amazing!❤

[@konscomputertutorials7473]

thank you very much for the explanation it was extremely helpful

[@harshitajain4763]

You are too good ma'am

[@jovinjoseph4493]

Best explanation 😊

[@yashshah4780]

So simple algorithm thank you mam for this

[@blabberq]

You saved my life, thanks!

[@kamyagupta4030]

Thank you soo much!!

[@awesome53559]

Super helpful. Thank you.

[@shivampatel8850]

it is so good , I like it

[@bellasvideo5620]

Too Good!

[@vineetkumar2899]

why you stopped making videos?

[@nicolamrvelj8659]

im in love with Lauren

[@ItsmenikhilKr]

I think the BST which you are creating using this pseudo code is not a true binary search tree.

[@begovsky5591]

Thank you so much !

[@charchitdhawan8907]

good explaining ma'am

[@Muzammil_310]

Thank you

[@JadeWinters02]

Very very useful

[@eva42sh]

thanx I could understand it

[@rupabisht1628]

Too clean, everything writing, audio and quality of content😊

[@fontanot]

Good job

[@muhammadarifkayani4337]

Student from Pakistan 🇵🇰❤️

[@AlekhyayadavVeerla]

Student from India 🇮🇳🇮🇳🇮🇳❤

[@banjaneyulu5914]

Pls upload on deletion operation also

[@vineetkumar2899]

thanks a lot.

[@tafveezahmad9692]

nice explANATION😀

[@binduyadav7646]

Tqsm mam..

[@shazaibmaqsood2957]

so smart

[@bharatlondhe9995]

❤❤

[@ribqaasif9406]

❤

[@asifkhan-rb8tl]

Make video no deletiom

[@dipeshchoudhary4276]

Hey I am a random guy who comments on random RUclips channels to motivate them instead of commenting on channels having millions of subscribers on RUclips......you are doing well....

[@nikhilshimpi12]

This only explains how to remember the answer but not how to find the answer; this only consider the an ideal use case.

[@lifemoments786]

mean urdu mein teach kiya kry

[@kavin3146]

maam i find your voice very cute

[@asap1309]

Her voice

[@satyammishra2508]

Chummi code.

[@lifemoments786]

teacher plz urdu bola kry

[@dennislarsen5744]

Thank you so much for this video.

[@AnujKumar-qm4cc]

Thanks mam 👍

[@harshitsharma-tp7wc]

thank you