L39. Introduction to Binary Search Tree | BST

[@takeUforward]

Please likeeee, shareeee and subscribeeeeeeee :) Also follow me at Insta: Striver_79

[@abhishekbandil1737]

At first i used to think there's a lot of competition in the world, but then i saw the amt of likes getting decreased with every video, that's where i got the intution that the actual competition is just of only few thousands.. Anyways loved your work throught the entire playlist 🥳🥳

[@Stellar_7x]

Thank you to make us confident .....

[@NavdeepSingh-qn1is]

Striver bhai content bhut sahi h appka, Had enrolled in Coding Ninjas course but here for revisions Spending thousands in courses but still here u can think how great your FAM admires you , Nothing more keep building more such series. CHAMP!

[@ayush_3652]

How is the coding ninjas course?

[@krishnkantshukla5355]

@@ayush_3652 do you want coding ninjas course

[@Deepaksharma-jq3um]

@@krishnkantshukla5355 yes

[@googlebaba4045]

@@Deepaksharma-jq3um message me i give you mega link for free

[@jeevaalok1467]

what's the song name at the end? anyone plse?

[@sathwikadommati9331]

It is so useful to know the subject in detailed, keep posting things.

[@mohit7717]

Thank you so much for such a great learning from your channel.....

[@ForTech-rt6qi]

I am having great learning with your channel. Thanks for the efforts !!

[@sauravchandra10]

Today is 21.07.23 and I am starting the BST playlist. The aim is to complete this series by 23.07.23

[@Akash-yr2if]

Hua Khatam?

[@sauravchandra10]

@@Akash-yr2if Hogya bro

[@lofireverbz-wy7go]

bro tumne cp kri hai kya agr hnn to mujhe thoda guide krdo bcoz oa crack ni hora intership k lia

[@lofireverbz-wy7go]

@sauravchandra10

[@sauravchandra10]

Haven't done CP@@lofireverbz-wy7go

[@ganeshjaggineni4097]

NICE SUPER EXCELLENT MOTIVATED

[@1tav0]

Thank you so much striver your are my friend for life

[@striverdaaadi]

awesome content

[@abhinabaprakashbora903]

Sir, You Are LEGEND

[@sarangkumarsingh7901]

Awesome..........

[@parthsalat]

He took this tree example from wikipedia: en.wikipedia.org/wiki/Binary_search_tree

[@ravalikatalks5285]

Thanks a lot for all free!

[@Kpriyasing]

Amazing Content!

[@mayurbhor2231]

Start a membership or a patron bro

[@parthsalat]

Under every video, there's a "thanks" button for donations

[@akasakasad]

Gonna complete BST by tomorrow i.e. 28/07/2023. Starting today

[@paraskamboj1039]

Thankyou so much sir

[@Mr.Indianwxvhehsy9191hghgx]

nice video sir

[@naveenkumarreddybadduri7775]

striver is God

[@UECAshutoshKumar]

Thank you sir

[@codeman3828]

Understood. thanks

[@TarunKumarSaraswat]

thanks

[@easycode3189]

Thanks Alot ! || Understood || Easy Explanation

[@SatyamKumar-bw4vi]

Hare Krishna !

[@Shivi32590]

thank you

[@himanshidafouty347]

Understood

[@KartikeyTT]

tysm sir

[@RohitVerma-yb4ch]

keep it up!

[@studyafa7159]

great

[@shivangisrivastava1158]

Just wow. !

[@atharvakulkarni2024]

Wonderfull Explanation!!!

[@111rhishishranjan2]

I am having lot of problem to understand trees series ☹☹☹☹☹

[@rajatvatwani7104]

Can the write of 3 have > 8 which is the root of the tree?

[@priyanshkumar17]

No

[@lavanyaprakashjampana933]

we love your content and we love you...

[@harshitjaiswal9439]

understood

[@shubhamkumarrai7711]

why we can not have 9 in place of 13 ??

[@harshthkkr]

3:29 - Why can't I have 9 in place of 13? It satisfies all the conditions.

[@priyanshkumar17]

The right subtree of 10 can't have a node with value

[@tanishkumar6682]

UNDERSTOOD

[@niteshgyanani9947]

Great content 😊

[@AnjaneyaDwivedi]

in the first example why 9 cant be there in place of 13?

[@priyanshkumar17]

See node 10. The right subtree of 10 can't have any node smaller than itself.

[@Ani-zi5he]

"Understood"

[@T_U_F]

Awesome!!!💯

[@nileshsinha7869]

UNDERSTOOD❤🙌

[@aakashmalhotra3157]

thanku

[@CpWithSunil]

[@sujan_kumar_mitra]

Understood

[@gantagourish7536]

understood

[@ishaankaustav727]

💚

[@kunalyewale7495]

completed :)

[@vibhu613]

❤❤

[@Addybhoot93]

What is BigO of N ?

[@chetanraghavv]

It is one of the way to represent asymptotic time complexity of an algorithm. Also called upper bound of an algorithm.

[@your_name96]

bhai iss playlist mey kya kar raha hai tu

[@humanity7880]

it is rasgulla

[@ShubhamKumar-et7gx]

bhiya BST create ka code btye na?

[@p38_amankuldeep75]

💝💖💝

[@suvanshmahajan5902]

"us"

[@dreamyme543]

Understood:)

[@piyushacharya7696]

reach++

[@AbhishekSharma-ip4df]

HEY Striver bro 😓😓please give back the geeks for geeks link beside every question. We have made hundreds of questions on GFG we started coding on GFG because it was in your sheet now if u only remove this how will we revise the question??????????? Now we have to search each question on GFG first then we are doing it, that is taking lot of time. If u have to put coding ninja link put it but don't remove GFG links.🙏🙏🙏🙏🙏🙏🙏🙏 GFG GFG GFG GFG GFG GFG GFG GFG GFG GFG GFG GFG GFG GFG !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

[@sibiranganath]

.

[@KaushikSharma-c3q]

..................

[@adityapandey23]

Understood

[@user-quietwicked]

understood

[@roopeshn3301]

Understood

[@NikhilGupta-zo5jh]

understood

[@ajayypalsingh]

💚

[@SibiRanganathL]

Understood

[@chiragbansod8252]

understood

[@t-anime517]

Understood

[@BG-lj6fw]

understood.

[@abhinanda7049]

understood

[@rishabhgupta9846]

understood

[@kartiksrivastava3897]

understood