Binary Search Tree in Python

[@SaifyKhan-o9v]

No BS, no time wasting, no unnecessary talk. Straight to the point. Beautiful. W channel.

[@JavaEnjoyer971]

what bs mean?

[@-CSE-ArnabSannigrahi]

There is literally no one who has taught this concept in python this easily so far in my knowledge.......thnank you

[@ЄвгенійНєстєров]

YES! Literally!

[@Daviesdev]

I love how you do things fast and don't make a big deal about writing good code

[@PepperingthePolls]

I never think that anyone teach BST so fast and clearly, but he is.

[@nvaishnavipai]

Literally best video ,i have watched like 10 other channels. i understood the best with this one! Thank you!

[@024_habeeb7]

better than anything out there on the internet. great work man ]

[@JordHaj]

At around 4:39 I think "if not self.value:" will only work as intended if we already know that we deal only with non-zero numbers(not 0 and 0.0) and non-empty iterables(not ( ,), [ ] and "") as they all will evaluate to False and we will be replacing that 0(or whatever) with value but not None which is the default and we don't want. In most cases, the "if not x:" and "if x is None:" structures are interchangable(again, non-zero numbers and non-empty iterables) but you really need the understanding when to use which one Edit: for the iterables, it could work if we make some custom parent class of the iterable which we implement comparing methods in, but what I mentioned before still applies to numbers

[@Torvating]

If you had posted this video 5 days ago. I would for sure be able to pass my exam on algorithm :c

[@Lerka-ok5ey]

Thank you so much, this was really helpful! Spent ages trying to work this out before coming across this video)

[@Лена-в1н6ы]

Thank you! For greener like me it was so much understandable!

[@canvasnature3282]

Awesome video finally a good one that helped me grasp the concepts. Thank You😊

[@scullyy]

14:25 Why do you suddenly need to return the function call? Isn't it enough to simply call the function like you've done up until this point.

[@MadiyarZhunussov]

thank you for the video! it was really helpful to get the grasp on it

[@scottlee38]

Finally a tutorial on how to actually use this thing.

[@coolkaw4497]

W video i watched a ton of videos on search trees and this is the only one that made complete sense!!

[@TheAveDavid]

Thank you, your explanation was super clear and super helpful!

[@musicsoul344]

Finally found amazing explanation of binary tree implementation. Wow

[@islamic_insights_daily]

thank you so much for this man, respect from Algeria

[@watson7813]

Thank you so much! Absolute godsend!

[@itsJustJayMusic]

Maaaan ! God Bless You . May Your Loved Ones Live Forever Alongside with you

[@simpledataengineer5231]

you should be teaching CS at MIT dude! amazing video!

[@LilJollyJoker]

Amazing Vid!

[@callme_arafat]

Your Video was Very Helpfull...

[@AnonYmous-pi1su]

Nice, thx for all your hard work making tutoring videos

[@timtim1333]

Thank you for providing value

[@EveliseGuenda]

You are the BESTTTTTTTT‼

[@RishiRajvid]

you are a very awesome teacher

[@EBEAST-tb1et]

Great help cheers mate

[@Zethos-qe2nj]

This guy is the goat

[@kumaryendamuri1599]

well explained

[@Jelvix]

Great...good job!

[@doudline2662]

Thank you sir.

[@zhspartan9993]

Thanks

[@jackshone7970]

I don't understand how your traversals ever printed anything but the most left node? It's clearly my thinking thats wrong, I'm aware, but you never go back up one after printing, so how does it happen?

[@scottmcfarland7842]

Hey, I think I can help you if you still don't understand it. Think of recursive functions like this: each time that the function gets called but hasn't made it to the last line of code, there is a function that hasn't been completed yet. That function will be waiting in the computer's memory for its time to continue where it left off. In his example where the root node is 10, by the time we get to Node 1 there are 4 unfinished function calls. Node 1 is the first node where self.left is no longer True or in other words where a left node doesn't exist. We print the value of the current node which is 1 and continue to check if there is a right node. There is no right node so that essentially terminates that function call. We then return to the most recent function call from Node 2. Upon returning to this function call we continue where it stopped. We had already checked if the left node exists so the next line of code gets executed which is the print statement. This prints the current value which is 2 and now we check if a right node exists. A right node does exist so we call the inorder traversal function on the right node. Left doesn't exist for node 3 so we print 3 to the terminal. We check if the right exists and it doesn't so that terminates that function call and we return to the next incomplete function call which is node 4... Hope this explanation helps

[@murshid-9188]

How will we delete a node from it

[@trantuanngoc]

He codes so fast 😮

[@Harreesh555]

Can binary search tree have duplicate values??

[@luisthesup]

Yes, I think it would go to the right of its parent node

[@charan2446]

Great man .......

[@abhinavchoudhary6849]

Awesome bro

[@youssefalaa2256]

Nacho Varga

[@jossuerguillen4550]

Lol kind of same but he is certainly smarter XD

[@FahmiEshaq]

Perfect

[@terkperrichard9857]

If I run your code is error

[@subi9601]

yeh same

[@rainman40]

same

[@alst4817]

The non binary network diagram on the thumbnail was triggering me 😂

[@krunalakbari9447]

waiting for the linklist

[@gamerkeyx]

You are a G

[@expectolimited]

6:44 []